Two extremal problems on intersecting families

DOI10.1016/j.ejc.2018.08.009zbMath1402.05206arXiv1804.11269OpenAlexW2963826084MaRDI QIDQ1633597

Hao Huang

Publication date: 20 December 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.11269

zbMATH Keywords

Kupavskii's conjecture

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items

Diversity of uniform intersecting families, Improved bounds on the maximum diversity of intersecting families, Diversity, Sharp results concerning disjoint cross-intersecting families, Minimum degree and diversity in intersecting antichains, Maximum degree and diversity in intersecting hypergraphs, Degree versions of theorems on intersecting families via stability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The eigenvalue method for cross \(t\)-intersecting families
• Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• The unbalance of set systems
• Disconnected vertex sets and equidistant code pairs
• Diversity of uniform intersecting families
• Antichains of fixed diameter
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A new generalization of the Erdős-Ko-Rado theorem