The famous bunkbed conjecture in probabilistic graph theory was disproven with a crazy counterexample with 7222 vertices! Papers cited: 1) The main paper by Gladkov, Pak, and Zimin: 2) The paper by Wagner documenting the machine learning algorithm: 3) The paper by Hollom giving the counterexample in the hypergraph generalization: 4) Blog Post by Pak explaining the paper a bit more colloquially: 5) Blog Post by Pak on “what if they are all wrong“, and the value of searching for counterexamples to conjectures: BECOME A MEMBER: ►Join: MATH BOOKS I LOVE (affilliate link): ► COURSE PLAYLISTS: ►DISCRETE MATH: ►LINEAR ALGEBRA: ►CALCULUS I: ► CALCULUS II: ►MULTIVARIABLE CALCULUS (Calc III): ►VECTOR CALCULUS (Calc IV) ►DIFFERENTIAL EQUATIONS: ►LAPLACE TRANSFORM: ►GAME THEORY: OTHER PLAYLISTS: ► Learning Math Series ►Cool Math Series: SOCIALS: ►X/Twitter: ►TikTok: @drtrefor ►Instagram (photography based):
Hide player controls
Hide resume playing