Cover Image

Counting independent sets in percolated graphs via the Ising model

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Geisler, Anna, Kang, Mihyun, Sarantis, Michail, Wdowinski, Ronen
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sampling from the antiferromagnetic Ising model on bipartite, regular expander graphs
by: Geisler, Anna, et al.
Published: (2026)

Counting independent sets in expanding bipartite regular graphs
by: Collares, Maurício, et al.
Published: (2025)

Constructing graphs with no independent transversals
by: Haxell, Penny, et al.
Published: (2023)

Tight constructions for reconfigurations of independent transversals
by: Wdowinski, Ronen
Published: (2026)

Block-weighted random graphs: planar and beyond
by: Kang, Mihyun, et al.
Published: (2026)

Bounded degree graphs and hypergraphs with no full rainbow matchings
by: Wdowinski, Ronen
Published: (2024)

Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs
by: Collares, Maurício, et al.
Published: (2024)

Majority bootstrap percolation on the permutahedron and other high-dimensional graphs
by: Collares, Maurício, et al.
Published: (2025)

Hall's theorem for reconfigurations and higher dimensional topological connectedness
by: Wdowinski, Ronen
Published: (2025)

Universality of the matching number in percolated regular graphs
by: Diskin, Sahar, et al.
Published: (2025)

Bootstrap percolation on the high-dimensional Hamming graph
by: Kang, Mihyun, et al.
Published: (2024)

A precise condition for independent transversals in bipartite covers
by: Cambie, Stijn, et al.
Published: (2023)

Counting independent sets in structured graphs
by: Bucić, Matija, et al.
Published: (2024)

On the number of antichains in $\{0,1,2\}^n$
by: Jenssen, Matthew, et al.
Published: (2026)

Counting subgraphs in bounded-size Achlioptas processes
by: Kang, Mihyun, et al.
Published: (2026)

Counting independent sets in regular graphs with bounded independence number
by: Galvin, David, et al.
Published: (2024)

Cycle lengths in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Nearly spanning cycle in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

A note on the width of sparse random graphs
by: Do, Tuan Anh, et al.
Published: (2022)

Uniqueness and locality of the ground state of the disordered Monomer-Dimer models on independently weighted Unimodular Bienaymé-Galton-Watson trees
by: Kang, Mihyun, et al.
Published: (2026)

Degree criteria and stability for independent transversals
by: Penny Haxell, et al.
Published: (2024)

Partition subcubic planar graphs into independent sets
by: Liu, Xujun, et al.
Published: (2024)

Partitioning problems via random processes
by: Anastos, Michael, et al.
Published: (2023)

Optimally building spanning graphs in semirandom graph processes
by: Anastos, Michael, et al.
Published: (2025)

Decoupling of clusters in independent sets in a percolated hypercube
by: Chowdhury, Mriganka Basu Roy, et al.
Published: (2025)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

A note on the alternating number of independent sets in a graph
by: Cutler, Jonathan, et al.
Published: (2024)

Bootstrap percolation on the Hamming graphs
by: Miralaei, Meysam, et al.
Published: (2024)

Warning Propagation on random graphs
by: Coja-Oghlan, Amin, et al.
Published: (2021)

Faster Mixing for Triangulations via Transport Flows
by: Alev, Vedat Levi, et al.
Published: (2026)

Gaussian to log-normal transition for independent sets in a percolated hypercube
by: Chowdhury, Mriganka Basu Roy, et al.
Published: (2024)

On the independent set polynomial of graphs and claw-free graphs
by: Fialho, Paula M. S., et al.
Published: (2025)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
by: Gamarnik, David, et al.
Published: (2023)

Fragile minor-monotone parameters under random edge perturbation
by: Kang, Dong Yeap, et al.
Published: (2020)

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

Piercing independent sets in graphs without large induced matching
by: Ai, Jiangdong, et al.
Published: (2024)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

Improved bounds for 1-independent percolation on $\mathbb{Z}^n$
by: Balister, Paul, et al.
Published: (2022)

Slow graph bootstrap percolation I: Cycles
by: Fabian, David, et al.
Published: (2023)

Counting cospectral graphs obtained via switching
by: Abiad, Aida, et al.
Published: (2025)