Independent sets of a given size and structure in the hypercube
DOI10.1017/S0963548321000559OpenAlexW3168571112MaRDI QIDQ5886339
Will Perkins, Aditya Potukuchi, Matthew Jenssen
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
hypercubeasymptotic enumerationindependent setscluster expansionpolymer modelslocal central limit theorem
Central limit and other weak theorems (60F05) Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Asymptotic enumeration (05A16) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- The independent set sequence of regular bipartite graphs
- Partitions of \(n\) into \(t\sqrt n\) parts
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
- The local central limit theorem for a Gibbs random field
- The central limit theorem and the problem of equivalence of ensembles
- Independent process approximations for random combinatorial structures
- Independent sets in the middle two layers of Boolean lattice
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube
- Algorithms for #BIS-Hard Problems on Expander Graphs
- The Structure of Random Partitions of Large Integers
- Complex martingales and asymptotic enumeration
- The number of graphs and a random graph with a given degree sequence
- Counting Partitions inside a Rectangle
- Independent sets in the hypercube revisited
This page was built for publication: Independent sets of a given size and structure in the hypercube
