The -free clique extremal conjecture
Let and let be sufficiently large. Let be an -vertex graph containing no cycle for any integer . For , write for the number of cliques of size in . Clique extremal conjecture.
Equality holds if and only if is divisible by and is a connected -vertex graph consisting of maximal -connected blocks, each isomorphic to . This conjecture asks whether the sharp block-decomposition phenomenon proved in the paper for sufficiently restricted odd circumferences extends to the family of forbidden cycle lengths congruent to modulo ; its resolution is not supplied here.
References
- Zequn Lv, Ervin Győri, Zhen He, Nika Salia, Chuanqi Xiao and Xiutao Zhu, “The maximum number of cliques in graphs with bounded odd circumference”, arXiv:2212.01989 (2022).
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.