The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
From MaRDI portal
(Redirected from Publication:2237385)
Recommendations
Cites work
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 194299 (Why is no real title available?)
- scientific article; zbMATH DE number 3503316 (Why is no real title available?)
- scientific article; zbMATH DE number 3523543 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 3616470 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3453609 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A homological approach to two problems on finite sets
- A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
- A structure theorem for Boolean functions with small total influences
- A survey of Turán problems for expansions
- An Extremal Set-Intersection Theorem
- An extremal set theoretical characterization of some Steiner systems
- An intersection theorem for four sets
- Boolean functions with low average sensitivity depend on few coordinates
- Combinatorial theorems in sparse random sets
- Contributions to the geometry of Hamming spaces
- Cross-intersecting families of finite sets
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Every monotone graph property has a sharp threshold
- Exact solution of some Turán-type problems
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Extremal results for random discrete structures
- Forbidden Intersections
- Forbidding just one intersection
- Forbidding just one intersection, for permutations
- Frankl-Rödl-type theorems for codes and permutations
- Hypergraph Turán numbers of linear cycles
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraph removal lemmas via robust sharp threshold theorems
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Improved bounds for Erdős' matching conjecture
- Inequalities in Fourier analysis
- Intersecting Families are Essentially Contained in Juntas
- Intersecting families of permutations
- Intersection Properties of Systems of Finite Sets
- Intersection theorems with geometric consequences
- Invitation to intersection problems for finite sets
- Kneser graphs are like Swiss cheese
- Learning Monotone Decision Trees in Polynomial Time
- Linear trees in uniform hypergraphs
- Logarithmic Sobolev Inequalities
- On Certain Sets of Integers
- On Sperner families satisfying an additional condition
- On \(r\)-cross intersecting families of sets
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
- On families of finite sets no two of which intersect in a singleton
- On finite set-systems whose every intersection is a kernel of a star
- On maximal paths and circuits of graphs
- On the critical percolation probabilities
- On the hardness of approximating minimum vertex cover
- On the measure of intersecting families, uniqueness and stability
- On the structure of linear graphs
- Proof of a conjecture of Erdős on triangles in set-systems
- Recent developments in extremal combinatorics: Ramsey and Turán type problems
- Regularity Lemma for k-uniform hypergraphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Set Systems with No Singleton Intersection
- Set systems without a simplex or a cluster
- Shadows and intersections: Stability and new proofs
- Sharp thresholds of graph properties, and the $k$-sat problem
- Some best possible inequalities concerning cross-intersecting families
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Structure and stability of triangle-free set systems
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The counting lemma for regular k‐uniform hypergraphs
- The exact bound in the Erdős-Ko-Rado theorem
- The size of a hypergraph and its matching number
- Thresholds and Expectation Thresholds
- Triangle-intersecting families of graphs
- Turán Problems and Shadows III: Expansions of Graphs
- Turán problems and shadows. I: Paths and cycles
- Turán problems and shadows. II: Trees
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
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
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- Extremal Problem for Matchings and Rainbow Matchings on Direct Products
- Hypergraph removal lemmas via robust sharp threshold theorems
- Hypergraphs without non-trivial intersecting subgraphs
- 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)
