Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Erdős–Burr_conjecture> ?p ?o }
Showing triples 1 to 56 of
56
with 100 triples per page.
- Erdős–Burr_conjecture abstract "In mathematics, the Erdős–Burr conjecture is a problem concerning the Ramsey number of sparse graphs. The conjecture is named after Paul Erdős and Stefan Burr, and is one of many conjectures named after Erdős; it states that the Ramsey number of graphs in any sparse family of graphs should grow linearly in the number of vertices of the graph.In 2015, a proof of the conjecture was announced by Choongbum Lee.".
- Erdős–Burr_conjecture wikiPageExternalLink arran.pdf.
- Erdős–Burr_conjecture wikiPageExternalLink 1975-26.pdf.
- Erdős–Burr_conjecture wikiPageID "3086101".
- Erdős–Burr_conjecture wikiPageLength "7695".
- Erdős–Burr_conjecture wikiPageOutDegree "25".
- Erdős–Burr_conjecture wikiPageRevisionID "703598797".
- Erdős–Burr_conjecture wikiPageWikiLink Category:Conjectures.
- Erdős–Burr_conjecture wikiPageWikiLink Category:Graph_theory.
- Erdős–Burr_conjecture wikiPageWikiLink Category:Paul_Erdős.
- Erdős–Burr_conjecture wikiPageWikiLink Category:Ramsey_theory.
- Erdős–Burr_conjecture wikiPageWikiLink Complete_graph.
- Erdős–Burr_conjecture wikiPageWikiLink Degeneracy_(graph_theory).
- Erdős–Burr_conjecture wikiPageWikiLink Dense_graph.
- Erdős–Burr_conjecture wikiPageWikiLink Discrete_Mathematics_(journal).
- Erdős–Burr_conjecture wikiPageWikiLink Graph_(discrete_mathematics).
- Erdős–Burr_conjecture wikiPageWikiLink Graph_theory.
- Erdős–Burr_conjecture wikiPageWikiLink Homeomorphism_(graph_theory).
- Erdős–Burr_conjecture wikiPageWikiLink Linear_function.
- Erdős–Burr_conjecture wikiPageWikiLink List_of_conjectures_by_Paul_Erdős.
- Erdős–Burr_conjecture wikiPageWikiLink Mathematics.
- Erdős–Burr_conjecture wikiPageWikiLink Null_graph.
- Erdős–Burr_conjecture wikiPageWikiLink Paul_Erdős.
- Erdős–Burr_conjecture wikiPageWikiLink Planar_graph.
- Erdős–Burr_conjecture wikiPageWikiLink Ramseys_theorem.
- Erdős–Burr_conjecture wikiPageWikiLink Stefan_Burr.
- Erdős–Burr_conjecture wikiPageWikiLink Vertex_(graph_theory).
- Erdős–Burr_conjecture wikiPageWikiLinkText "Erdős–Burr conjecture".
- Erdős–Burr_conjecture wikiPageUsesTemplate Template:Citation.
- Erdős–Burr_conjecture wikiPageUsesTemplate Template:Harvtxt.
- Erdős–Burr_conjecture wikiPageUsesTemplate Template:Refbegin.
- Erdős–Burr_conjecture wikiPageUsesTemplate Template:Refend.
- Erdős–Burr_conjecture wikiPageUsesTemplate Template:Reflist.
- Erdős–Burr_conjecture subject Category:Conjectures.
- Erdős–Burr_conjecture subject Category:Graph_theory.
- Erdős–Burr_conjecture subject Category:Paul_Erdős.
- Erdős–Burr_conjecture subject Category:Ramsey_theory.
- Erdős–Burr_conjecture hypernym Problem.
- Erdős–Burr_conjecture type Disease.
- Erdős–Burr_conjecture type Combinatoric.
- Erdős–Burr_conjecture type Conjecture.
- Erdős–Burr_conjecture type Diacritic.
- Erdős–Burr_conjecture type Field.
- Erdős–Burr_conjecture type Redirect.
- Erdős–Burr_conjecture type Relation.
- Erdős–Burr_conjecture type Statement.
- Erdős–Burr_conjecture type Statement.
- Erdős–Burr_conjecture comment "In mathematics, the Erdős–Burr conjecture is a problem concerning the Ramsey number of sparse graphs. The conjecture is named after Paul Erdős and Stefan Burr, and is one of many conjectures named after Erdős; it states that the Ramsey number of graphs in any sparse family of graphs should grow linearly in the number of vertices of the graph.In 2015, a proof of the conjecture was announced by Choongbum Lee.".
- Erdős–Burr_conjecture label "Erdős–Burr conjecture".
- Erdős–Burr_conjecture sameAs Q2993299.
- Erdős–Burr_conjecture sameAs Conjecture_dErdxc5x91s-Burr.
- Erdős–Burr_conjecture sameAs m.08qfr2.
- Erdős–Burr_conjecture sameAs Гипотеза_Эрдёша_—_Бура.
- Erdős–Burr_conjecture sameAs Q2993299.
- Erdős–Burr_conjecture wasDerivedFrom Erdős–Burr_conjecture?oldid=703598797.
- Erdős–Burr_conjecture isPrimaryTopicOf Erdős–Burr_conjecture.