three_graph_link
def
The link graph of a vertex i in a 3-uniform hypergraph F: two distinct vertices j, k are adjacent iff {i, j, k} is an edge of F.
Statement
def three_graph_link {V : Type*} [DecidableEq V] (F : Finset (Finset V)) (i : V) : SimpleGraph V
- Defined in
- arXiv:2610.11642 (A counterexample to the bipartite-link conjecture for 3-graphs), Sec. 1 (vertex link graph ∂_i F of a 3-graph).
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Used by 3
- three_graph_link_adj_iffIn the link graph of i, j and k are adjacent iff they are distinct and {i, j, k} (in either order of j, k) is an edge.
- three_graph_link_template_zero_adjIn the template, 1 and 4 are adjacent in the link of 0 (since {0, 1, 4} is an edge).
- bipartite_link_template_three_graph_links_colorable_twoEvery vertex link graph of the 9-vertex template 3-graph is bipartite (2-colorable).
Lean source view module on GitHub
/-- The link graph of the vertex `i` in a 3-uniform hypergraph `F` (a family of 3-sets): distinct `j, k` are adjacent iff `{i, j, k} ∈ F`. -/ def three_graph_link {V : Type*} [DecidableEq V] (F : Finset (Finset V)) (i : V) : SimpleGraph V := SimpleGraph.fromRel (fun j k => ({i, j, k} : Finset V) ∈ F)