The minimum number of disjoint pairs in set systems and related problems

DOI10.1007/s00493-014-3133-0zbMath1399.05218arXiv1305.6715OpenAlexW1647101336MaRDI QIDQ524186

Wenying Gan, Shagnik Das, Benjamin Sudakov

Publication date: 25 April 2017

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

set systemsdisjoint pairs

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items

Edge isoperimetric inequalities for powers of the hypercube ⋮ Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations ⋮ A simple removal lemma for large nearly-intersecting families ⋮ Supersaturation in posets and applications involving the container method ⋮ Structure and supersaturation for intersecting families ⋮ A short note on supersaturation for oddtown and eventown ⋮ The number of additive triples in subsets of abelian groups ⋮ Reflect-push methods. Part I: Two dimensional techniques ⋮ Sperner's Theorem and a Problem of Erdős, Katona and Kleitman ⋮ On the random version of the Erdős matching conjecture ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ On the number of monotone sequences ⋮ Disjoint pairs in set systems with restricted intersection ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ Most probably intersecting hypergraphs

Cites Work

• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• On induced subgraphs of the cube
• Maximum bipartite subgraphs of Kneser graphs
• Simple hypergraphs with maximal number of adjacent pairs of edges
• On the minimum number of disjoint pairs in a family of finite sets
• Set systems with few disjoint pairs
• On Erdős' extremal problem on matchings in hypergraphs
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• Most Probably Intersecting Families of Subsets
• The Size of a Hypergraph and its Matching Number
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Graphs with maximal number of adjacent pairs of edges
• A Counterexample to Kleitman's Conjecture Concerning an Edge-Isoperimetric Problem
• Almost Intersecting Families of Sets
• Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
• Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs
• On products of idempotent matrices