Bunkbed conjecture
Conjecture in probabilistic combinatorics
The bunkbed conjecture (also spelled bunk bed conjecture) is a statement in percolation theory, a branch of mathematics that studies the behavior of connected clusters in a random graph. The conjecture is named after its analogy to a bunk bed structure. It was first posited by Pieter Kasteleyn in 1985.
Nº Q124116607 ★
Common · Knowledge
Bunkbed conjecture
Conjecture in probabilistic combinatorics
The bunkbed conjecture (also spelled bunk bed conjecture) is a statement in percolation theory, a branch of mathematics that studies the behavior of connected clusters in a random graph. The conjecture is named after its analogy to a bunk bed structure. It was first posited by Pieter Kasteleyn in 1985.
From Wikipedia
The bunkbed conjecture (also spelled bunk bed conjecture) is a statement in percolation theory, a branch of mathematics that studies the behavior of connected clusters in a random graph. The conjecture is named after its analogy to a bunk bed structure. It was first posited by Pieter Kasteleyn in 1985. In 2024, Nikita Gladkov, Igor Pak, and Alexander Zimin gave a counter-example to the bunkbed conjecture, proving that it is false.
Text: Wikipédia, CC BY-SA 4.0. · Image: Священный бритый ёжик (CC0) ·
Related cards
-
S
Singmaster's conjecture
Conjecture in combinatorial number theory
Nº Q2993335 ★★
Not listed
-
Union-closed sets conjecture
1979 conjecture in combinatorics
Nº Q2993338 ★
Not listed
-
Abc conjecture
Number theory conjecture
Nº Q306393 ★★★★
Not listed
-
S
Szpiro's conjecture
Conjecture in number theory
Nº Q829242 ★
Not listed
-
W
Witten conjecture
Conjecture in algebraic geometry
Nº Q8028565 ★
Not listed
-
Bernoulli trial
Any experiment with two possible random outcomes
Nº Q1077800 ★
Not listed