Mubayi–Mukherjee conjecture for ex(n,K₃, P̂_k)
For every fixed integer , let be the path on vertices and let be its suspension, obtained by adding one new vertex adjacent to every vertex of . Then, as , the maximum number of triangles in an -vertex graph containing no subgraph isomorphic to satisfies , where denotes this maximum.
References
- Counting triangles in graphs without suspensions of paths — arXiv — Chunyang Dou, Xing Peng
Source: arXiv
Progress summary
An unrefereed preprint claims to prove the conjecture for every fixed path length, but this claim has not been independently checked.
Mubayi and Mukherjee conjectured the asymptotic formula for the maximum number of triangles in an -free graph. The latest preprint claims a uniform proof for every fixed , extending the previously known cases.
Known results
- The conjectured asymptotic formula was previously known for .
- For , the exact value is for .
- For sufficiently large , , with a unique extremal graph.
- The earlier literature described the cases as unresolved beyond the conjectured lower bound.
October 2026 claimed uniform proof
On October 13, 2026, Chunyang Dou and Xing Peng posted Counting triangles in graphs without suspensions of paths, claiming the conjectured formula for every fixed . The result would settle the conjecture, but the preprint is unrefereed and no independent mathematical assessment was found.
Current status (as of October 2026): The conjecture is claimed solved for every fixed by an unrefereed preprint, while the claim remains unverified.
Solutions 0
No solutions have been posted yet.