Cover Image

An elementary proof of the bunkbed conjecture for forests

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Donderwinkel, Serte, Jorritsma, Joost, Perarnau, Guillem
Format:	Preprint
Published:	2025
Subjects:	Probability Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024)

Counting graphic sequences via integrated random walks
by: Balister, Paul, et al.
Published: (2023)

To see the forest for the trees: On the infinite divisibility of unlabeled forests
by: Bassan, Michal, et al.
Published: (2025)

Random trees have height $O(\sqrt{n})$
by: Addario-Berry, Louigi, et al.
Published: (2022)

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

Minimum stationary values of sparse random directed graphs
by: Cai, Xing Shi, et al.
Published: (2020)

Tournaments and random walks
by: Donderwinkel, Serte, et al.
Published: (2024)

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)

Maximum flow and self-avoiding walk on bunkbed graphs
by: Tang, Pengfei
Published: (2025)

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

The bunkbed conjecture is false
by: Gladkov, Nikita, et al.
Published: (2024)

Composition of random functions and word reconstruction
by: Chapuy, Guillaume, et al.
Published: (2026)

Sinaĭ excursions: An analogue of Sparre Andersen's formula for the area process of a random walk
by: Donderwinkel, Serte, et al.
Published: (2024)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

Refined Horton-Strahler numbers I: a discrete bijection
by: Addario-Berry, Louigi, et al.
Published: (2024)

The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026)

The bunkbed conjecture still holds for cactus graphs and for graphs with certain biconnected components
by: Denart, Robin
Published: (2025)

First Order Logic of Sparse Graphs with Given Degree Sequences
by: Larrauri, Alberto, et al.
Published: (2024)

Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
by: Kwan, Matthew, et al.
Published: (2022)

Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method
by: Bassan, Michal, et al.
Published: (2024)

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

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

A proof of the Erdős primitive set conjecture
by: Lichtman, Jared Duker
Published: (2022)

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

Graphical sequences and plane trees
by: Bassan, Michal, et al.
Published: (2024)

An information-theoretic proof of a hypercontractive inequality
by: Friedgut, Ehud
Published: (2015)

Evolution of recursive trees with limited memory
by: Angel, Omer, et al.
Published: (2025)

Temporal connectivity of Random Geometric Graphs
by: Brandenberger, Anna, et al.
Published: (2025)

On Sibuya trees and forests
by: Huillet, Thierry E
Published: (2025)

The critical percolation window in growing random graphs
by: Jorritsma, Joost, et al.
Published: (2025)

Large deviations of the giant component in scale-free inhomogeneous random graphs
by: Jorritsma, Joost, et al.
Published: (2024)

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
by: Christoph, Micha, et al.
Published: (2026)

Note on a conjecture of Talagrand: expectation thresholds vs. fractional expectation thresholds
by: Dubroff, Quentin, et al.
Published: (2024)

A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips
by: Segert, Simon
Published: (2024)

The Lonely Runner Conjecture turns 60
by: Perarnau, Guillem, et al.
Published: (2024)

Local limit of massive spanning forests on the complete graph
by: D'Achille, Matteo, et al.
Published: (2024)

Short proofs in combinatorics, probability and number theory II
by: Alexeev, Boris, et al.
Published: (2026)

A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs
by: Kathapurkar, Amarja, et al.
Published: (2025)

Lonely passengers: a short proof
by: Haslegrave, John
Published: (2025)

An elementary proof of Sierksma's conjecture for seven points in the plane
by: Soberón, Pablo
Published: (2026)