Year: 2025
Type: article
Abstract: Let $${\mathcal {H}}$$ H be a k -uniform hypergraph on n vertices. For a fixed positive integer s , the most natural way to define a subhypergraph of $${\mathcal {H}}$$ H without $$s + 1$$ s + 1 pairwise disjoint edges is to take all edges containing at least one of s fixed vertices. We prove that for $$n > n_0(k, s)$$ n > n 0 ( k , s ) and a relatively wide class of hypergraphs this construction is the largest.
Source: Periodica Mathematica Hungarica
Author: P. Frankl
Institution: HUN-REN Alfréd Rényi Institute of Mathematics
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,090
OpenAlex ID: W4414509004