Transfer theorem converts max-degree independence bounds to average-degree bounds for hereditary uniform hypergraphs, with applications to cycle-free graphs and bounded-clique graphs.
17730(preprint), 2026 (cit
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hypergraph independence bounds: from maximum degree to average degree
Transfer theorem converts max-degree independence bounds to average-degree bounds for hereditary uniform hypergraphs, with applications to cycle-free graphs and bounded-clique graphs.