Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

An elementary proof of the bunkbed conjecture for forests

Serte Donderwinkel, Joost Jorritsma, Guillem Perarnau

Abstract

Although false for general graphs, this note gives an elementary proof of the bunkbed conjecture for any acyclic graph. The argument is short and self-contained, and may be of educational interest.

An elementary proof of the bunkbed conjecture for forests

Abstract

Although false for general graphs, this note gives an elementary proof of the bunkbed conjecture for any acyclic graph. The argument is short and self-contained, and may be of educational interest.

Paper Structure

This paper contains 4 equations.

Theorems & Definitions (2)

  • proof : Proof for the path $P_n$
  • proof : Proof for arbitrary forests