A short proof for a theorem of Harper about Hamming-spheres
From MaRDI portal
Publication:1162510
DOI10.1016/0012-365X(81)90009-1zbMath0482.05002OpenAlexW2014107477MaRDI QIDQ1162510
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(81)90009-1
Related Items (23)
The treewidth and pathwidth of hypercubes ⋮ Compressions and Probably Intersecting Families ⋮ A problem of Shapozenko on Johnson graphs ⋮ Matchings and paths in the cube ⋮ Local Expansion of Symmetrical Graphs ⋮ A generalization of the Katona theorem for cross t-intersecting families ⋮ A lower bound on the size of a complex generated by an antichain ⋮ Dimension 1 sequences are close to randoms ⋮ When Are Fuzzy Extractors Possible? ⋮ A lower bound for the vertex boundary-width of complete \(k\)-ary trees ⋮ Stability for vertex isoperimetry in the cube ⋮ Indexability, concentration, and VC theory ⋮ Extremal set theory for the binomial norm ⋮ A note on Hamming spheres ⋮ Simulation theorems via pseudo-random properties ⋮ On Eulerian orientations of even-degree hypercubes ⋮ Two remarks on ``Expanding and forwarding by P. Solé ⋮ Phase transitions in phylogeny ⋮ Solving and sampling with many solutions: Satisfiability and other hard problems ⋮ Odd and even Hamming spheres also have minimum boundary ⋮ \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators ⋮ Compressions and isoperimetric inequalities ⋮ Isoperimetric inequalities and fractional set systems
Cites Work
This page was built for publication: A short proof for a theorem of Harper about Hamming-spheres
