corona_k1
The corona product G ⊙ K_1 of a graph G with K_1 is the graph on vertex set V ⊕ V where the first copy induces G, each vertex in the second copy is a leaf attached to its corresponding vertex in G, and there are no edges between leaves.
Statement
def corona_k1 {V : Type*} (G : SimpleGraph V) : SimpleGraph (Sum V V)
- Defined in
- arXiv:2610.36821 Section 5
- Verified
- 28 Oct 2026
- Axioms
- none listed
- Used by 7
- corona_k1_exists_maximal_geodesicFor every finite type V with 2 ≤ Fintype.card V and every connected simple graph G on V, there exist vertices x, y : V ⊕ V and a walk p…
- corona_k1_is_maximal_geodesic_of_isPath_of_distIn the corona product corona_k1 G of a finite graph G, every walk between distinct pendant leaves Sum.inr u and Sum.inr v that is a path…
- corona_k1_exists_edge_geodesic_transversalFor every finite type V with 2 ≤ Fintype.card V and every connected simple graph G on V, there exists a finset S of edges of the corona…
- corona_k1_exists_geodesic_between_leavesFor every finite type V and every connected simple graph G on V, between any two leaves Sum.inr u and Sum.inr v in corona_k1 G, there…
- edge_geodesic_transversal_number_corona_k1_card_twoFor every finite type V with Fintype.card V = 2 and every connected simple graph G on V, the edge geodesic transversal number of the…
- corona_k1_maximal_geodesic_endpointsFor every finite type V with 2 ≤ Fintype.card V and every connected simple graph G on V, if p is a walk between x and y in corona_k1 G…
- edge_geodesic_transversal_number_corona_k1_leFor every finite type V with 2 ≤ Fintype.card V and every connected simple graph G on V, the edge geodesic transversal number of the…
Read back from the Lean
Given a type V and a simple graph G on V, corona_k1 G is the simple graph on the disjoint union V ⊕ V (Sum V V) where:
- two vertices Sum.inl u and Sum.inl v are adjacent if and only if u and v are adjacent in G;
- a vertex Sum.inl u and a vertex Sum.inr v are adjacent if and only if u = v;
- a vertex Sum.inr u and a vertex Sum.inl v are adjacent if and only if u = v;
- no two vertices of the form Sum.inr _ are adjacent.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The corona product G ⊙ K_1 of a simple graph G with K_1, formed by attaching a pendant leaf to every vertex of G. -/ def corona_k1 {V : Type*} (G : SimpleGraph V) : SimpleGraph (Sum V V) := { Adj := fun x y => match x, y with | Sum.inl u, Sum.inl v => G.Adj u v | Sum.inl u, Sum.inr v => u = v | Sum.inr u, Sum.inl v => u = v | Sum.inr _, Sum.inr _ => False symm := ⟨by rintro (u | u) (v | v) h · exact G.symm.symm _ _ h · exact h.symm · exact h.symm · contradiction⟩ loopless := ⟨by rintro (u | u) h · exact G.loopless.irrefl u h · contradiction⟩ }