Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Erdős–Faber–Lovász_conjecture> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- Erdős–Faber–Lovász_conjecture abstract "In graph theory, the Erdős–Faber–Lovász conjecture is an unsolved problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in 1972. It says:If k complete graphs, each having exactly k vertices, have the property that every pair of complete graphs has at most one shared vertex, then the union of the graphs can be colored with k colors.↑".
- Erdős–Faber–Lovász_conjecture thumbnail Erdős–Faber–Lovász_conjecture.svg?width=300.
- Erdős–Faber–Lovász_conjecture wikiPageID "691803".
- Erdős–Faber–Lovász_conjecture wikiPageRevisionID "543792839".
- Erdős–Faber–Lovász_conjecture subject Category:Conjectures.
- Erdős–Faber–Lovász_conjecture subject Category:Graph_coloring.
- Erdős–Faber–Lovász_conjecture subject Category:Paul_Erdős.
- Erdős–Faber–Lovász_conjecture comment "In graph theory, the Erdős–Faber–Lovász conjecture is an unsolved problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in 1972. It says:If k complete graphs, each having exactly k vertices, have the property that every pair of complete graphs has at most one shared vertex, then the union of the graphs can be colored with k colors.↑".
- Erdős–Faber–Lovász_conjecture label "Erdős–Faber–Lovász conjecture".
- Erdős–Faber–Lovász_conjecture sameAs Erd%C5%91s%E2%80%93Faber%E2%80%93Lov%C3%A1sz_conjecture.
- Erdős–Faber–Lovász_conjecture sameAs Q5385322.
- Erdős–Faber–Lovász_conjecture sameAs Q5385322.
- Erdős–Faber–Lovász_conjecture wasDerivedFrom Erdős–Faber–Lovász_conjecture?oldid=543792839.
- Erdős–Faber–Lovász_conjecture depiction Erdős–Faber–Lovász_conjecture.svg.