Logo
Tags Prizes
More
FAQ Problem Lists Definitions Links How to help
All Random Solved Random Open
SOLVED
If $G$ is a graph with $n$ vertices and $>n^2/4$ edges then it contains a triangle on $x,y,z$ such that \[d(x)+d(y)+d(z) \geq \frac{3}{2}n.\]
A conjecture of Bollobás and Erdős. This was proved by Edwards [Ed78].