The prime-cycle clique extremal conjecture
Let be a prime number, and let be the family of all cycles of length at least . For integers and satisfying , let denote the maximum number of copies of in an -vertex graph containing no member of . Prime-cycle clique extremal conjecture.
Equality holds if and only if is divisible by and the extremal graph is a connected -vertex graph consisting of maximal -connected blocks, each isomorphic to . This proposes a prime-parameter analogue of the preceding clique bound for graphs with forbidden long cycles; no resolution is supplied in the source.
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.