e/Erdos-Burr conjecture

Information
has gloss	eng: 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.
lexicalization	eng: Erdos-Burr conjecture
lexicalization	eng: Erdős-Burr conjecture
lexicalization	eng: Erdős–Burr conjecture
instance of	(noun) a hypothesis that has been formed by speculating or conjecturing (usually with little hard evidence); "speculations about the outcome of the election"; "he dismissed it as mere conjecture" conjecture, speculation

Meaning
French
has gloss	fra: En 1973, Erdős et Burr ont proposé la conjecture suivante:
lexicalization	fra: Conjecture d'Erdős-Burr