On a biased edge isoperimetric inequality for the discrete cube
From MaRDI portal
Publication:1713503
DOI10.1016/j.jcta.2018.12.001zbMath1403.05037arXiv1702.01675OpenAlexW2963768244WikidataQ128832826 ScholiaQ128832826MaRDI QIDQ1713503
Noam Lifshitz, Nathan Keller, David Ellis
Publication date: 25 January 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.01675
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Distance in graphs (05C12) Graph theory (05C99)
Related Items (3)
Unnamed Item ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ On the union of intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- A structure theorem for Boolean functions with small total influences
- The complete intersection theorem for systems of finite sets
- On the hardness of approximating minimum vertex cover
- Shadows and intersections: Stability and new proofs
- Extremal problems concerning Kneser-graphs
- A note on the edges of the n-cube
- Boolean functions with low average sensitivity depend on few coordinates
- On Russo's approximate zero-one law
- Boolean functions: influence, threshold and noise
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Triangle-intersecting families of graphs
- Almost Isoperimetric Subsets of the Discrete Cube
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Thresholds and Expectation Thresholds
- An approximate zero-one law
- Sharp thresholds of graph properties, and the $k$-sat problem
- Assignment of Numbers to Vertices
- Every monotone graph property has a sharp threshold
- Weighted multiply intersecting families
- An Inequality for Functions on the Hamming Cube
- Maximally Connected Arrays on the n-Cube
- Optimal Assignments of Numbers to Vertices
- Noise sensitivity of Boolean functions and applications to percolation
This page was built for publication: On a biased edge isoperimetric inequality for the discrete cube
