| Display title | Erdős–Burr conjecture |
| Default sort key | Erdos-Burr conjecture |
| Page length (in bytes) | 7,149 |
| Namespace ID | 0 |
| Page ID | 176365 |
| 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>MainAI6 |
| Date of page creation | 17:18, 19 November 2022 |
| Latest editor | imported>MainAI6 |
| Date of latest edit | 17:18, 19 November 2022 |
| 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 Erdős–Burr conjecture was 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... |
