Diversity of uniform intersecting families

DOI10.1016/J.EJC.2018.07.005zbMath1394.05137arXiv1709.02829OpenAlexW2963283436WikidataQ129424776 ScholiaQ129424776MaRDI QIDQ1671747

Andrey B. Kupavskii

Publication date: 7 September 2018

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

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

zbMATH Keywords

Frankl's conjecture

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (17)

Two extremal problems on intersecting families ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ A generalization of Kneser graphs ⋮ Fixed-Parameter Algorithms for the Kneser and Schrijver Problems ⋮ Uniform intersecting families with large covering number ⋮ Improved bounds on the maximum diversity of intersecting families ⋮ A generalization of diversity for intersecting families ⋮ Diversity ⋮ Minimum degree and diversity in intersecting antichains ⋮ Diversity and intersecting theorems for weak compositions ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ Maximum degree and diversity in intersecting hypergraphs ⋮ Degree versions of theorems on intersecting families via stability ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• The complete intersection theorem for systems of finite sets
• On the hardness of approximating minimum vertex cover
• The unbalance of set systems
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Two extremal problems on intersecting families
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• Regular bipartite graphs and intersecting families
• The junta method in extremal hypergraph theory and Chvátal's conjecture
• Antichains of fixed diameter
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting Families are Essentially Contained in Juntas
• Counting Intersecting and Pairs of Cross-Intersecting Families
• Analysis of Boolean Functions
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Diversity of uniform intersecting families