Gan–Loh–Sudakov triangle extremal conjecture
Let be a graph on vertices with maximum degree . Write
Here and are the quotient and remainder in the division of by . Gan–Loh–Sudakov's conjecture. The number of triangles in is at most
References
4 papers in this index state this conjecture (2014–2019). The statement above is taken from the most recent of them; the others are arXiv:1809.03729, arXiv:1709.06163, arXiv:1405.1322.
Status
- Solved: Zachary Chase. The Maximum Number of Triangles in a Graph of Given Maximum Degree (Advances in Combinatorics, 2020) https://www.advancesincombinatorics.com/article/16788-the-maximum-number-of-triangles-in-a-graph-of-given-maximum-degree
Source: Zachary Chase, “The Maximum Number of Triangles in a Graph of Given Maximum Degree”, arXiv:1912.01600 (2020).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.