On the order of intersecting hypergraphs
Combinatorics
2025-04-08 v1
Abstract
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.
Cite
@article{arxiv.2504.05162,
title = {On the order of intersecting hypergraphs},
author = {Stijn Cambie and Jaehoon Kim and Hyunwoo Lee and Hong Liu and Tuan Tran},
journal= {arXiv preprint arXiv:2504.05162},
year = {2025}
}
Comments
13 pages