Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems
From MaRDI portal
Publication:5126774
DOI10.19086/da.14165zbMath1450.05061arXiv1804.00328OpenAlexW3048319395MaRDI QIDQ5126774
Publication date: 20 October 2020
Published in: discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.00328
Related Items (2)
Hypercontractivity for global functions and sharp thresholds ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
Cites Work
- 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
- Noise sensitivity in continuum percolation
- Turán problems and shadows. I: Paths and cycles
- Hypergraph containers
- A new proof of the graph removal lemma
- A variant of the hypergraph removal lemma
- Noise stability of functions with low influences: invariance and optimality
- Forbidding just one intersection
- Threshold functions
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Exact solution of some Turán-type problems
- Inequalities in Fourier analysis
- Boolean functions with low average sensitivity depend on few coordinates
- Influences of variables and threshold intervals under group symmetries
- The complete nontrivial-intersection theorem for systems of finite sets
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Gaussian bounds for noise correlation of functions
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Removal and Stability for Erdös--Ko--Rado
- Graph removal lemmas
- A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds
- A survey of Turán problems for expansions
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Geometric bounds on the Ornstein-Uhlenbeck velocity process
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Intersecting Families are Essentially Contained in Juntas
- Conditional Hardness for Approximate Coloring
- Forbidden Intersections
- An approximate zero-one law
- Logarithmic Sobolev Inequalities
- On families of finite sets no two of which intersect in a singleton
- Intersection Properties of Systems of Finite Sets
- 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
- Analysis of Boolean Functions
- Independent sets in hypergraphs
- Turán Problems and Shadows III: Expansions of Graphs
- Stability results for random discrete structures
- Set Systems with No Singleton Intersection
- The counting lemma for regular k‐uniform hypergraphs
This page was built for publication: Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems
