An elementary proof of the bunkbed conjecture for forests

TL;DR

This paper provides a simple, self-contained proof of the bunkbed conjecture specifically for acyclic graphs, offering an accessible approach that could serve educational purposes.

Contribution

It presents an elementary, concise proof of the bunkbed conjecture for forests, expanding understanding in this specific graph class.

Findings

Proof is valid for all acyclic graphs.

The argument is short and self-contained.

Potential educational value for teaching graph theory.

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.