Intersecting families of discrete structures are typically trivial

DOI10.1016/j.jcta.2015.01.003zbMath1307.05199arXiv1408.2559OpenAlexW2131713099WikidataQ105583647 ScholiaQ105583647MaRDI QIDQ2258906

József Balogh, Maryam Sharifzadeh, Shagnik Das, Hong Liu, Michelle Delcourt

Publication date: 27 February 2015

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

permutationsErdős-Ko-Rado theoremhypergraphsextremal combinatoricsvector spacesKneser graphrandom hypergraphsintersecting familiesBollobás set-pairs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items (19)

On the structure of large sum-free sets of integers ⋮ Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations ⋮ TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM ⋮ THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS ⋮ Clique number of Xor products of Kneser graphs ⋮ A simple removal lemma for large nearly-intersecting families ⋮ Structure and supersaturation for intersecting families ⋮ Applications of graph containers in the Boolean lattice ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Intersecting families of sets are typically trivial ⋮ Counting Intersecting and Pairs of Cross-Intersecting Families ⋮ On hypergraphs without loose cycles ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ Colourings without monochromatic disjoint pairs ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ On “stability” in the Erdös--Ko--Rado Theorem ⋮ On Erdős–Ko–Rado for random hypergraphs I ⋮ On the Chromatic Index of Random Uniform Hypergraphs ⋮ On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraph containers
• Stability for \(t\)-intersecting families of permutations
• The exact bound in the Erdős-Ko-Rado theorem
• Setwise intersecting families of permutations
• Geometrical solution of an intersection problem for two hypergraphs
• A Hilton-Milner theorem for vector spaces
• Explicit construction of linear sized tolerant networks
• An extremal problem for two families of sets
• Intersection theorems for systems of finite vector spaces
• The complete nontrivial-intersection theorem for systems of finite sets
• Counting sum-free sets in abelian groups
• On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Erdős–Ko–Rado in Random Hypergraphs
• On the Shannon capacity of a graph
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• On Erdős–Ko–Rado for Random Hypergraphs II
• On Erdős–Ko–Rado for random hypergraphs I
• Independent sets in hypergraphs
• Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
• On generalized graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• Intersecting families of permutations

This page was built for publication: Intersecting families of discrete structures are typically trivial