Shadows and intersections: Stability and new proofs
From MaRDI portal
Publication:932174
DOI10.1016/j.aim.2008.03.023zbMath1160.05055arXiv0806.2023OpenAlexW2130523901WikidataQ105583558 ScholiaQ105583558MaRDI QIDQ932174
Publication date: 10 July 2008
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.2023
Permutations, words, matrices (05A05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05)
Related Items (34)
TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM ⋮ A simple removal lemma for large nearly-intersecting families ⋮ On the rank of higher inclusion matrices ⋮ Upper tails via high moments and entropic stability ⋮ Remarks on the Erdős matching conjecture for vector spaces ⋮ Vertex isoperimetry and independent set stability for tensor powers of cliques ⋮ An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ Set Systems with L-Intersections and k-Wise L-Intersecting Families ⋮ Complete \(r\)-partite graphs determined by their domination polynomial ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ A product version of the Hilton-Milner theorem ⋮ A product version of the Hilton-Milner-Frankl theorem ⋮ Hypercontractivity on the symmetric group ⋮ Inclusion matrices for rainbow subsets ⋮ Minimising the total number of subsets and supersets ⋮ Stability for vertex isoperimetry in the cube ⋮ Shadows of ordered graphs ⋮ An Inequality for Functions on the Hamming Cube ⋮ Stability theorems for some Kruskal-Katona type results ⋮ Shadows and intersections in vector spaces ⋮ On a biased edge isoperimetric inequality for the discrete cube ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Almost Isoperimetric Subsets of the Discrete Cube ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Diversity ⋮ On the structure of subsets of the discrete cube with small edge boundary ⋮ Stability of the Potential Function ⋮ On the densities of cliques and independent sets in graphs ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ Resilience of ranks of higher inclusion matrices ⋮ Invitation to intersection problems for finite sets ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family ⋮ A Deza-Frankl type theorem for set partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the use of determinant for proving lower bounds on the size of linear circuits
- Set systems without a simplex or a cluster
- A new short proof for the Kruskal-Katona theorem
- On the measure of intersecting families, uniqueness and stability
- Threshold functions
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- A simple proof of the Kruskal-Katona theorem and of some associated binomial inequalities
- On the number of copies of one hypergraph in another
- Improved lower bounds on the rigidity of Hadamard matrices
- Minimal eigenvalue of the Coxeter Laplacian for the symmetric group
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
- A simple proof of the Kruskal-Katona theorem
- Erdős-Ko-Rado from Kruskal-Katona
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting Families are Essentially Contained in Juntas
- Symmetric groups and expanders
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- A Certain Class of Incidence Matrices
This page was built for publication: Shadows and intersections: Stability and new proofs
