| Display title | Burr–Erdős conjecture |
| Default sort key | Erdos-Burr conjecture |
| Page length (in bytes) | 7,283 |
| Namespace ID | 0 |
| Page ID | 327842 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Smart bot editor |
| Date of page creation | 23:16, 6 February 2024 |
| Latest editor | imported>Smart bot editor |
| Date of latest edit | 23:16, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematics, the Burr–Erdős conjecture was a problem concerning the Ramsey number of sparse graphs. The conjecture is named after Stefan Burr and Paul Erdős, 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... |
