Burr–Erdős conjecture
id:
burr-erd-s-conjecture-232-3710930
title:
Burr–Erdős conjecture
text:
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 in the number of vertices of the graph. The conjecture was proven by Choongbum Lee. Thus it is now a theorem.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Burr%E2%80%93Erd%C5%91s_conjecture
date created:
date modified:
2023-12-28T20:08:35Z
main entity:
{"identifier":"Q2993299","url":"https://www.wikidata.org/entity/Q2993299"}
image:
fields total:
13
integrity:
13