On cliques in hypergraphs

2025/10/16 by Gao, Jun · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2510.14804

Abstract

We prove that for any k ≥ 3, every k-uniform hypergraph on n vertices contains at most n - ω(1) different sizes of cliques (maximal complete subgraphs). In particular, the 3-uniform case answers a question of Erdős.

Citations

• On cliques in graphs

Cited by

• On the distinct maximal-clique sizes in 3-uniform hypergraphs

Related

• On the distinct maximal-clique sizes in 3-uniform hypergraphs
• The number of cliques in hypergraphs with forbidden subgraphs
• The Maximum Number of Cliques in Hypergraphs without Large Matchings
• About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
• Disperse Hypergraphs