Theoretical analysis investigates bounds on the maximum order of constrained intersecting hypergraphs, revealing new vertex-level limits in extremal combinatorics.
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.
No takes yet. Share an insight, caveat, or question.
Cambie et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: