Edge isoperimetric inequalities for powers of the hypercube
From MaRDI portal
Publication:2121790
DOI10.37236/9032zbMath1486.05159arXiv1909.10435OpenAlexW2973317480MaRDI QIDQ2121790
Cyrus Rashtchian, William Raynaud
Publication date: 4 April 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.10435
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum number of disjoint pairs in set systems and related problems
- Edge-isoperimetric inequalities in the grid
- On a problem of Kleitman and West
- A note on the edges of the n-cube
- A stability result for the cube edge isoperimetric inequality
- An isoperimetric inequality for Hamming balls and local expansion in hypercubes
- Edge-isoperimetric inequalities and ball-noise stability: linear programming and probabilistic approaches
- The number of 4-colorings of the Hamming cube
- Stability for vertex isoperimetry in the cube
- Vertex-isoperimetric stability in the hypercube
- Graphs with maximal number of adjacent pairs of edges
- Assignment of Numbers to Vertices
- Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube
- On the structure of subsets of the discrete cube with small edge boundary
- A Counterexample to Kleitman's Conjecture Concerning an Edge-Isoperimetric Problem
- A Moment Ratio Bound for Polynomials and Some Extremal Properties of Krawchouk Polynomials and Hamming Spheres
- An isoperimetric inequality for the Hamming cube and some consequences
- Concentration on the Boolean hypercube via pathwise stochastic analysis
- Sparse Hashing for Scalable Approximate Model Counting
- Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs
- Families of Non-disjoint subsets
- Maximally Connected Arrays on the n-Cube
- A generalization of a combinatorial theorem of macaulay
- Optimal Assignments of Numbers to Vertices
This page was built for publication: Edge isoperimetric inequalities for powers of the hypercube
