Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Erdős–Burr_conjecture> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Erdős–Burr_conjecture abstract "In mathematics, the Erdős–Burr conjecture is an unsolved 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.".
- Erdős–Burr_conjecture wikiPageID "3086101".
- Erdős–Burr_conjecture wikiPageRevisionID "544187732".
- 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 comment "In mathematics, the Erdős–Burr conjecture is an unsolved 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.".
- Erdős–Burr_conjecture label "Conjecture d'Erdős-Burr".
- Erdős–Burr_conjecture label "Erdős–Burr conjecture".
- Erdős–Burr_conjecture label "Гипотеза Эрдёша — Бура".
- Erdős–Burr_conjecture sameAs Erd%C5%91s%E2%80%93Burr_conjecture.
- Erdős–Burr_conjecture sameAs Conjecture_d'Erdős-Burr.
- Erdős–Burr_conjecture sameAs Q2993299.
- Erdős–Burr_conjecture sameAs Q2993299.
- Erdős–Burr_conjecture wasDerivedFrom Erdős–Burr_conjecture?oldid=544187732.