Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Erdős–Faber–Lovász_conjecture> ?p ?o }
Showing triples 1 to 57 of
57
with 100 triples 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 wikiPageExternalLink paper25.pdf.
- Erdős–Faber–Lovász_conjecture wikiPageExternalLink 0095-8956(91)90046-M.
- Erdős–Faber–Lovász_conjecture wikiPageExternalLink 2323901.
- Erdős–Faber–Lovász_conjecture wikiPageID "691803".
- Erdős–Faber–Lovász_conjecture wikiPageLength "10693".
- Erdős–Faber–Lovász_conjecture wikiPageOutDegree "26".
- Erdős–Faber–Lovász_conjecture wikiPageRevisionID "704731787".
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink American_Mathematical_Monthly.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Category:Conjectures.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Category:Graph_coloring.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Category:Paul_Erdős.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Clone_(algebra).
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Complete_graph.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Edge_coloring.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Fractional_coloring.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Graph_coloring.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Graph_theory.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Hypergraph.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Intersection_graph.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Intersection_number_(graph_theory).
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Line_graph_of_a_hypergraph.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink List_of_conjectures_by_Paul_Erdős.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink László_Lovász.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Partial_linear_space.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Paul_Erdős.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink Vance_Faber.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLink File:Erdős–Faber–Lovász_conjecture.svg.
- Erdős–Faber–Lovász_conjecture wikiPageWikiLinkText "Erdős–Faber–Lovász conjecture".
- Erdős–Faber–Lovász_conjecture wikiPageUsesTemplate Template:Citation.
- Erdős–Faber–Lovász_conjecture wikiPageUsesTemplate Template:Harvtxt.
- Erdős–Faber–Lovász_conjecture wikiPageUsesTemplate Template:Math.
- Erdős–Faber–Lovász_conjecture wikiPageUsesTemplate Template:Mvar.
- Erdős–Faber–Lovász_conjecture wikiPageUsesTemplate Template:Refbegin.
- Erdős–Faber–Lovász_conjecture wikiPageUsesTemplate Template:Refend.
- Erdős–Faber–Lovász_conjecture wikiPageUsesTemplate Template:Reflist.
- Erdős–Faber–Lovász_conjecture wikiPageUsesTemplate Template:Sqrt.
- 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 hypernym Problem.
- Erdős–Faber–Lovász_conjecture type Disease.
- Erdős–Faber–Lovász_conjecture type Conjecture.
- Erdős–Faber–Lovász_conjecture type Diacritic.
- Erdős–Faber–Lovász_conjecture type Redirect.
- Erdős–Faber–Lovász_conjecture type Statement.
- Erdős–Faber–Lovász_conjecture type Statement.
- 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 Q5385322.
- Erdős–Faber–Lovász_conjecture sameAs حدس_اردیش–فابر–لوواش.
- Erdős–Faber–Lovász_conjecture sameAs m.0335h2.
- Erdős–Faber–Lovász_conjecture sameAs Q5385322.
- Erdős–Faber–Lovász_conjecture wasDerivedFrom Erdős–Faber–Lovász_conjecture?oldid=704731787.
- Erdős–Faber–Lovász_conjecture depiction Erdős–Faber–Lovász_conjecture.svg.
- Erdős–Faber–Lovász_conjecture isPrimaryTopicOf Erdős–Faber–Lovász_conjecture.