Matches in DBpedia 2014 for { ?s ?p 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.. }
Showing items 1 to 2 of
2
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 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.".