The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
From MaRDI portal
Publication:2237385
DOI10.1016/J.AIM.2021.107991zbMath1476.05146OpenAlexW3201180760WikidataQ113881016 ScholiaQ113881016MaRDI QIDQ2237385
Publication date: 27 October 2021
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2021.107991
Erdős-Ko-Rado theoremextremal combinatoricsintersection theoremsdiscrete Fourier analysisjunta methodErdős-Chvátal simplex conjecture
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean functions (06E30)
Related Items (11)
Rainbow version of the Erdős Matching Conjecture via concentration ⋮ Hypergraphs without non-trivial intersecting subgraphs ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Approximation by juntas in the symmetric group, and forbidden intersection problems ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Hypercontractivity for global functions and sharp thresholds ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ Erdős matching conjecture for almost perfect matchings ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Maximum degree and diversity in intersecting hypergraphs ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turán problems and shadows. II: Trees
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Improved bounds for Erdős' matching conjecture
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- A structure theorem for Boolean functions with small total influences
- Turán problems and shadows. I: Paths and cycles
- Set systems without a simplex or a cluster
- The complete intersection theorem for systems of finite sets
- Invitation to intersection problems for finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- On finite set-systems whose every intersection is a kernel of a star
- An extremal set theoretical characterization of some Steiner systems
- On the hardness of approximating minimum vertex cover
- Shadows and intersections: Stability and new proofs
- On the measure of intersecting families, uniqueness and stability
- Forbidding just one intersection
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Exact solution of some Turán-type problems
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
- Intersection theorems with geometric consequences
- Some best possible inequalities concerning cross-intersecting families
- On Sperner families satisfying an additional condition
- Inequalities in Fourier analysis
- Contributions to the geometry of Hamming spaces
- Boolean functions with low average sensitivity depend on few coordinates
- A homological approach to two problems on finite sets
- Cross-intersecting families of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Proof of a conjecture of Erdős on triangles in set-systems
- An intersection theorem for four sets
- Triangle-intersecting families of graphs
- Hypergraph Turán numbers of linear cycles
- Forbidding just one intersection, for permutations
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Linear trees in uniform hypergraphs
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Frankl-Rödl-type theorems for codes and permutations
- The Size of a Hypergraph and its Matching Number
- A survey of Turán problems for expansions
- On r-Cross Intersecting Families of Sets
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Structure and stability of triangle-free set systems
- Thresholds and Expectation Thresholds
- Learning Monotone Decision Trees in Polynomial Time
- Intersecting Families are Essentially Contained in Juntas
- Forbidden Intersections
- On the critical percolation probabilities
- An Extremal Set-Intersection Theorem
- Logarithmic Sobolev Inequalities
- On families of finite sets no two of which intersect in a singleton
- Intersection Properties of Systems of Finite Sets
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
- Sharp thresholds of graph properties, and the $k$-sat problem
- Kneser graphs are like Swiss cheese
- Every monotone graph property has a sharp threshold
- Regularity Lemma for k-uniform hypergraphs
- Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems
- Turán Problems and Shadows III: Expansions of Graphs
- A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
- Set Systems with No Singleton Intersection
- The counting lemma for regular k‐uniform hypergraphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Certain Sets of Integers
- On the structure of linear graphs
- Intersecting families of permutations
This page was built for publication: The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
