Frankl–Gryaznov–Talebanfard's clique-counting conjecture for hypergraphs
Let be an -vertex -graph. A clique is a subset such that either , or and every -subset of belongs to . Let be the number of cliques, and define
Frankl–Gryaznov–Talebanfard's conjecture. If contains no clique of size , then
Furthermore, when and , the unique extremal case is the -vertex -partite -graph whose edge set consists of all -sets intersecting each part in at most vertices. This conjecture gives a sharp upper bound on the total number of cliques and specifies the equality case under the stated divisibility conditions.
References
- Wanfang Chen, Jinghua Deng, Jianfeng Hou, Xizhi Liu and Yixiao Zhang, “Vertex-colored Turán theorems with applications in extremal hypergraph problems”, arXiv:2606.02210 (2026).
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.