The gadget has edges
ProvedBunkbedAux.gadgetE_cardThe gadget of Gladkov--Pak--Zimin (Figure 2) has vertex set and consists of a path on the vertices , together with a hub joined to every path vertex. It is the graph used to simulate a -hyperedge, with the three distinguished vertices being the hub and the two ends of the path.
This theorem counts its edges:
namely the spokes for , plus the path edges for .
The proof splits the edge set into those two families, shows each has the stated size, and shows they are disjoint — a spoke is incident to the hub and a path edge is not.
Mathematical role. This is the combinatorial input to the edge count of the counterexample graph of Theorem 1.2. That graph substitutes a copy of for each of the six hyperedges of Hollom's hypergraph, and the six copies are edge-disjoint, so its edge count is
which is the figure appearing in the statement of Theorem 1.2.
import Definitions.Def_BunkbedPercolation open Bunkbed SimpleGraph Finset
namespace BunkbedAux /-- **The gadget `Gₙ` has `2n - 1` edges**: `n` spokes from the apex to each path vertex, and `n - 1` path edges. -/ theorem gadgetE_card (n : ℕ) : (gadgetE n).card = 2 * n - 1 := by sorry end BunkbedAux