Independent sets of a given size and structure in the hypercube

DOI10.1017/S0963548321000559MaRDI QIDQ5886339zbMATH OpenOpenAlexFDO

Authors Matthew Jenssen, Will Perkins, Aditya Potukuchi

Publication date 31 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2106.09709

zbMATH Keywords

asymptotic enumerationcluster expansionhypercubeindependent setslocal central limit theorempolymer models

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Central limit and other weak theorems (60F05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Recommendations

• Independent sets in the hypercube revisited
• A threshold phenomenon for random independent sets in the discrete hypercube
• Note on the number of balanced independent sets in the Hamming cube
• Independent sets in the middle two layers of Boolean lattice
• A note on balanced independent sets in the cube

Cites work

• A threshold phenomenon for random independent sets in the discrete hypercube
• Algorithms for \#BIS-hard problems on expander graphs
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• Complex martingales and asymptotic enumeration
• Counting partitions inside a rectangle
• scientific article; zbMATH DE number 3833857 (Why is no real title available?)
• scientific article; zbMATH DE number 4160792 (Why is no real title available?)
• Independent process approximations for random combinatorial structures
• Independent sets in the hypercube revisited
• Independent sets in the middle two layers of Boolean lattice
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• Partitions of \(n\) into \(t\sqrt n\) parts
• The central limit theorem and the problem of equivalence of ensembles
• The independent set sequence of regular bipartite graphs
• The local central limit theorem for a Gibbs random field
• The number of graphs and a random graph with a given degree sequence
• The Structure of Random Partitions of Large Integers

Cited in

(15)

• Polymer dynamics via cliques: new conditions for approximations
• Note on the number of balanced independent sets in the Hamming cube
• Independent sets in the middle two layers of Boolean lattice
• scientific article; zbMATH DE number 5901714 (Why is no real title available?)
• A threshold phenomenon for random independent sets in the discrete hypercube
• A note on balanced independent sets in the cube
• Independent sets in the hypercube revisited
• Approximately counting independent sets in bipartite graphs via graph containers
• On the zeroes of hypergraph independence polynomials
• Counting independent sets in percolated graphs via the Ising model
• A refined graph container lemma and applications to the hard-core model on bipartite expanders
• A spectral approach to approximately counting independent sets in dense bipartite graphs
• On the evolution of structure in triangle-free graphs
• Independent sets in discrete tori of odd sidelength
• On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice

This page was built for publication: Independent sets of a given size and structure in the hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886339)