The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
From MaRDI portal
Publication:2237385
DOI10.1016/J.AIM.2021.107991zbMATH Open1476.05146OpenAlexW3201180760WikidataQ113881016 ScholiaQ113881016MaRDI QIDQ2237385FDOQ2237385
Authors: Nathan Keller, Noam Lifshitz 
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
Recommendations
extremal combinatoricsintersection theoremsdiscrete Fourier analysisjunta methodErdős-Ko-Rado theoremErdős-Chvátal simplex conjecture
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal set theory (05D05) Boolean functions (06E30)
Cites Work
- Title not available (Why is that?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Title not available (Why is that?)
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Forbidden Intersections
- Title not available (Why is that?)
- Regularity Lemma for k-uniform hypergraphs
- The counting lemma for regular k‐uniform hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of linear graphs
- Forbidding just one intersection
- Intersection theorems with geometric consequences
- Inequalities in Fourier analysis
- Contributions to the geometry of Hamming spaces
- The complete nontrivial-intersection theorem for systems of finite sets
- Logarithmic Sobolev Inequalities
- Title not available (Why is that?)
- The complete intersection theorem for systems of finite sets
- On the hardness of approximating minimum vertex cover
- Boolean functions with low average sensitivity depend on few coordinates
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Title not available (Why is that?)
- A structure theorem for Boolean functions with small total influences
- Every monotone graph property has a sharp threshold
- The exact bound in the Erdős-Ko-Rado theorem
- Exact solution of some Turán-type problems
- A homological approach to two problems on finite sets
- On the critical percolation probabilities
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Turán problems and shadows. I: Paths and cycles
- Title not available (Why is that?)
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Certain Sets of Integers
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Sharp thresholds of graph properties, and the $k$-sat problem
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Thresholds and Expectation Thresholds
- Intersecting Families are Essentially Contained in Juntas
- Set systems without a simplex or a cluster
- Shadows and intersections: Stability and new proofs
- On the measure of intersecting families, uniqueness and stability
- Some best possible inequalities concerning cross-intersecting families
- Proof of a conjecture of Erdős on triangles in set-systems
- Hypergraph Turán numbers of linear cycles
- Linear trees in uniform hypergraphs
- Turán problems and shadows. II: Trees
- Title not available (Why is that?)
- On families of finite sets no two of which intersect in a singleton
- The size of a hypergraph and its matching number
- On \(r\)-cross intersecting families of sets
- Learning Monotone Decision Trees in Polynomial Time
- Intersecting families of permutations
- Improved bounds for Erdős' matching conjecture
- Intersection Properties of Systems of Finite Sets
- Set Systems with No Singleton Intersection
- On finite set-systems whose every intersection is a kernel of a star
- On Sperner families satisfying an additional condition
- An intersection theorem for four sets
- Triangle-intersecting families of graphs
- An Extremal Set-Intersection Theorem
- Title not available (Why is that?)
- Invitation to intersection problems for finite sets
- Recent developments in extremal combinatorics: Ramsey and Turán type problems
- Turán Problems and Shadows III: Expansions of Graphs
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
- Structure and stability of triangle-free set systems
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Forbidding just one intersection, for permutations
- Frankl-Rödl-type theorems for codes and permutations
- Cross-intersecting families of finite sets
- A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
- An extremal set theoretical characterization of some Steiner systems
- Title not available (Why is that?)
- A survey of Turán problems for expansions
- Hypergraph removal lemmas via robust sharp threshold theorems
- Kneser graphs are like Swiss cheese
Cited In (16)
- Spectral radius and rainbow Hamilton paths of a graph
- Simple juntas for shifted families
- Improved bounds concerning the maximum degree of intersecting hypergraphs
- Erdős matching conjecture for almost perfect matchings
- Hypercontractivity for global functions and sharp thresholds
- Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
- Rainbow perfect matchings for 4-uniform hypergraphs
- Improved covering results for conjugacy classes of symmetric groups via hypercontractivity
- Extremal Problem for Matchings and Rainbow Matchings on Direct Products
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- Hypergraphs without non-trivial intersecting subgraphs
- Hypergraph removal lemmas via robust sharp threshold theorems
- Maximum degree and diversity in intersecting hypergraphs
- On the rainbow matching conjecture for 3-uniform hypergraphs
- Rainbow version of the Erdős Matching Conjecture via concentration
- Approximation by juntas in the symmetric group, and forbidden intersection problems
This page was built for publication: The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237385)
