The substituted graph has 14442 edges, three transversal vertices, and is connected
ProvedBunkbedFalse.sub_invariantsTheorem 1.2 of Gladkov--Pak--Zimin asserts the existence of a connected graph on vertices with edges and a transversal set of size three, on which bunkbed percolation at violates the conjecture. This theorem establishes the three combinatorial assertions for the explicit graph constructed by substituting a copy of the gadget for each of the six hyperedges of Hollom's hypergraph.
-
Edge count. . The six embedded copies are pairwise disjoint, each copy is an injective image of , and has edges, so the total is . Since no embedded edge is a loop, the number of edges of the graph agrees with the cardinality of the edge set.
-
Transversal set. , being the injective image of . Three is the smallest number of transversal vertices for which the bunkbed conjecture can fail.
-
Connectivity. Each gadget copy is connected, because its apex is adjacent to every one of its path vertices. The copies are then glued along the path : copy contains both the -th and the -st vertex of that path. So every vertex reaches — first by moving inside its own copy to that copy's apex or path end, then by walking down the chain of copies.
Mathematical role. Together with the identification of bunkbed percolation on this graph as a Wierman--Ziff model on Hollom's hypergraph, and the verification that the gadget's partition probabilities satisfy the conditions of the robustness lemma, these three facts complete Theorem 1.2. Note that the published Theorem 1.2 also asserts planarity; that cannot presently be stated, as Mathlib has no notion of a planar graph, so the formalised statement is weaker in that respect.
import Definitions.Def_BunkbedSubstituted open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedFalse
/-- **The invariants of the substituted graph.** It has 14442 edges, its transversal set has three
vertices, and it is connected. -/
theorem sub_invariants :
(ofEdges Bunkbed.Sub.subEdges).edgeFinset.card = 14442 ∧ Bunkbed.Sub.subT.card = 3
∧ (ofEdges Bunkbed.Sub.subEdges).Connected := by
sorry
end BunkbedFalse