2025/04/07 by Cambie, Stijn, Kim, Jaehoon, Lee, Hyunwoo +2
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2504.05162
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems concerning the maximum order of such hypergraphs. In this paper, we systematically study these vertex analogues.