Cover Image

The bunkbed conjecture is false

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gladkov, Nikita, Pak, Igor, Zimin, Aleksandr
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics Probability 05C80, 60C05, 60K35 G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The acyclic directed bunkbed conjecture is false
by: Przybyłowski, Tomasz
Published: (2025)

The bunkbed conjecture is not robust to generalisation
by: Hollom, Lawrence
Published: (2024)

Bond percolation does not simulate site percolation
by: Gladkov, Nikita, et al.
Published: (2024)

The bunkbed conjecture remains true when gluing along a vertex
by: Meunier, Paul, et al.
Published: (2024)

Percolation Inequalities and Decision Trees
by: Gladkov, Nikita
Published: (2024)

Isomorphisms between dense random graphs
by: Surya, Erlang, et al.
Published: (2023)

The bunkbed problem and the random cluster model
by: Ayyer, Arvind, et al.
Published: (2025)

Some Thoughts on Graph Similarity
by: Grohe, Martin
Published: (2024)

Cover and Hitting Times of Hyperbolic Random Graphs
by: Kiwi, Marcos, et al.
Published: (2022)

The clique chromatic number of sparse random graphs
by: Fernandez V, Manuel, et al.
Published: (2024)

On the concentration of the chromatic number of random graphs
by: Surya, Erlang, et al.
Published: (2022)

Explosive appearance of cores and bootstrap percolation on lattices
by: Hartarsky, Ivailo, et al.
Published: (2025)

Wasserstein distances between ERGMs and Erdős-Rényi models
by: Winstein, Vilas
Published: (2026)

Concentration via metastable mixing, with applications to the supercritical exponential random graph model
by: Winstein, Vilas
Published: (2025)

Quantitative central limit theorems for exponential random graphs
by: Winstein, Vilas
Published: (2025)

On the complexity of Sandwich Problems for $M$-partitions
by: Barsukov, Alexey, et al.
Published: (2026)

Perfect Matching in Product Graphs and in their Random Subgraphs
by: Diskin, Sahar, et al.
Published: (2024)

Minimum degree $k$ and $k$-connectedness usually arrive together
by: Diskin, Sahar, et al.
Published: (2024)

Large Deviations for Markovian Graphon Processes and Associated Dynamical Systems on Networks
by: Bhamidi, Shankar, et al.
Published: (2025)

Small maximal clusters are very unlikely in critical random graphs
by: De Ambroggio, Umberto
Published: (2024)

Models of random spanning trees
by: Babson, Eric, et al.
Published: (2024)

Non-exchangeable mean-field theory for adaptive weights: propagation of dissociatedness and graphon sampling lemma
by: Zhou, Datong
Published: (2025)

Asymptotic size of the Karp-Sipser Core in Configuration Model
by: Chatterjee, Arnab, et al.
Published: (2025)

Reconstructing graphs and their connectivity using graphlets
by: Hartman, David, et al.
Published: (2025)

Network evolution with self-reinforcement
by: Bhamidi, Shankar, et al.
Published: (2026)

Can the root cluster remain largest forever in random recursive tree percolation?
by: Zheng, Yushu
Published: (2026)

The degree-restricted random process is far from uniform
by: Molloy, Michael, et al.
Published: (2022)

The sharp threshold for jigsaw percolation in random graphs
by: Cooley, Oliver, et al.
Published: (2018)

Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants
by: Nagel, Leonhard
Published: (2025)

$H$-percolation with a random $H$
by: Bartha, Zsolt, et al.
Published: (2023)

The scaling limit of the volume of loop O(n) quadrangulations
by: Aïdékon, Élie, et al.
Published: (2024)

Sharp Square Root Bounds for Edge Eigenvector Universality in Sparse Random Regular Graphs
by: Nagel, Leonhard
Published: (2025)

Modularity of preferential attachment graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)

Tangled Paths: A Random Graph Model from Mallows Permutations
by: Enright, Jessica, et al.
Published: (2021)

Sharp Fuss-Catalan thresholds in graph bootstrap percolation
by: Bartha, Zsolt, et al.
Published: (2025)

The rank of sparse random matrices
by: Coja-Oghlan, Amin, et al.
Published: (2019)

The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
by: Abbasizanjani, Hoda, et al.
Published: (2020)

Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Note on edge expansion and modularity in preferential attachment graphs
by: McDiarmid, Colin, et al.
Published: (2026)

Permutons from Demazure Products
by: Defant, Colin
Published: (2025)