AFTD Auto-Formalizing Theoretical Domains

subcubic_rich_neighbor_five_isolated_vertex_extend

theoremverified

If v is an isolated vertex of the finite simple graph G and the induced subgraph of G on the vertices other than v admits a rich-neighbor 5-edge-colouring, then G admits one.

Statement

theorem subcubic_rich_neighbor_five_isolated_vertex_extend {V : Type*}
    [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (v : V)
    (hiso : G.degree v = 0)
    (hc : ∃ c : (G.induce {w | w ≠ v}).lineGraph.Coloring (Fin 5),
      simple_graph_is_rich_neighbor_coloring (G.induce {w | w ≠ v}) c) :
    ∃ c : G.lineGraph.Coloring (Fin 5), simple_graph_is_rich_neighbor_coloring G c
Source
step towards subcubic_maxDegree_induce_V3_le_two_exists_rich_neighbor_five_coloring
Verified
29 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • simple_graph_edge_is_richIn an edge colouring c, an edge e is rich if all edges adjacent to e receive pairwise distinct colours.
  • simple_graph_is_rich_neighbor_coloringA proper edge colouring is a rich-neighbor edge colouring if every non-isolated edge (one with at least one adjacent edge) is adjacent to…
  • g$g(S,M) = \dim_{\mathbb{F}_p}(S^{\perp}_M) - \dim_{\mathbb{F}_p}(S_M)$.

The proof, explained

Because v has degree 0, no edge of G has v as an endpoint. Consequently, the edge set of G is naturally in bijection with the edge set of the induced subgraph G minus {v}, and this bijection preserves vertex incidences, yielding an isomorphism between their line graphs. Any rich-neighbor edge colouring on G minus {v} can then be transported across this isomorphism to a rich-neighbor edge colouring on G.

  1. An isolated vertex cannot be an endpoint of any edge of G

    Assume for contradiction that v belongs to some edge e = s(x, y). Then either v = x or v = y. In either case, the other endpoint is a neighbor of v in G, which implies that the degree of v is strictly positive, contradicting the assumption that G.degree v = 0.

    lines 4–19

    uses Sym2.ind, Sym2.mem_iff, SimpleGraph.mem_neighborFinset, Finset.card_pos.mpr

      intro hv
      rcases e with ⟨e, he⟩
      induction e using Sym2.ind with
      | h x y =>
        rw [Sym2.mem_iff] at hv
        rcases hv with rfl | rfl
        · have hnb : y ∈ G.neighborFinset v := by
            simp only [SimpleGraph.mem_neighborFinset]
            exact he
          have hpos : 0 < G.degree v := Finset.card_pos.mpr ⟨y, hnb⟩
          omega
        · have hnb : x ∈ G.neighborFinset v := by
            simp only [SimpleGraph.mem_neighborFinset]
            exact he.symm
          have hpos : 0 < G.degree v := Finset.card_pos.mpr ⟨x, hnb⟩
          omega
  2. Every edge of an induced subgraph G.induce s maps to an edge of G under the inclusion of vertices

    Writing an edge e of G.induce s as an unordered pair s(a, b) of vertices in s, its adjacency in the induced subgraph is by definition the adjacency of their underlying values in G. Mapping Subtype.val across the pair produces an edge of G.

    lines 24–29

    uses Sym2.ind, Sym2.map_mk, SimpleGraph.mem_edgeSet

      rcases e with ⟨e, he⟩
      induction e using Sym2.ind with
      | h a b =>
        rw [Sym2.map_mk, SimpleGraph.mem_edgeSet]
        rw [SimpleGraph.mem_edgeSet] at he
        exact he
  3. The canonical map from the edges of G.induce s to the edges of G is injective

    If two edges of the induced subgraph have the same image under toG, their underlying unordered pairs of subtype elements map to the same unordered pair in V. Since Subtype.val is injective, the induced map on unordered pairs is injective, so the edges are identical.

    lines 38–42

    uses Subtype.mk.injEq, Subtype.ext, Sym2.map.injective, Subtype.val_injective

      intro e₁ e₂ h
      obtain ⟨e₁, h₁⟩ := e₁
      obtain ⟨e₂, h₂⟩ := e₂
      simp only [subcubic_rich_neighbor_five_isolated_vertex_extend_toG, Subtype.mk.injEq] at h
      exact Subtype.ext (Sym2.map.injective Subtype.val_injective h)
  4. The canonical map from the edges of G minus {v} to the edges of G is surjective when v is isolated

    Given any edge e = s(x, y) of G, neither x nor y can equal v because v has degree 0. Thus both x and y belong to {w | w ≠ v}. They form an edge in the induced subgraph whose image in G is e.

    lines 48–67

    uses Sym2.ind, subcubic_rich_neighbor_five_isolated_vertex_extend_not_mem_edge, SimpleGraph.mem_edgeSet, SimpleGraph.induce_adj, Subtype.ext, Sym2.map_mk

      intro ⟨e, he⟩
      induction e using Sym2.ind with
      | h x y =>
        have hxv : x ≠ v := by
          intro h
          apply subcubic_rich_neighbor_five_isolated_vertex_extend_not_mem_edge G v hiso ⟨s(x, y), he⟩
          simp [h]
        have hyv : y ≠ v := by
          intro h
          apply subcubic_rich_neighbor_five_isolated_vertex_extend_not_mem_edge G v hiso ⟨s(x, y), he⟩
          simp [h]
        let x' : {w | w ≠ v} := ⟨x, hxv⟩
        let y' : {w | w ≠ v} := ⟨y, hyv⟩
        have he' : s(x', y') ∈ (G.induce {w | w ≠ v}).edgeSet := by
          rw [SimpleGraph.mem_edgeSet, SimpleGraph.induce_adj]
          exact he
        refine ⟨⟨s(x', y'), he'⟩, ?_⟩
        apply Subtype.ext
        change Sym2.map Subtype.val s(x', y') = s(x, y)
        rw [Sym2.map_mk]
  5. Two edges in G.induce s are adjacent in its line graph if and only if their images under toG are adjacent in the line graph of G

    Adjacency in the line graph means that two edges are distinct and share a vertex. By injectivity of toG, the images are distinct if and only if the original edges are distinct. Furthermore, sharing a vertex in the subtype s corresponds bijectively to sharing the underlying vertex in V.

    lines 74–94

    uses SimpleGraph.lineGraph_adj_iff_exists, subcubic_rich_neighbor_five_isolated_vertex_extend_toG_injective, and_congr_right, Subtype.coe_mk, Sym2.mem_map, Subtype.ext

      rw [SimpleGraph.lineGraph_adj_iff_exists, SimpleGraph.lineGraph_adj_iff_exists]
      have hne : subcubic_rich_neighbor_five_isolated_vertex_extend_toG G s e₁ ≠
          subcubic_rich_neighbor_five_isolated_vertex_extend_toG G s e₂ ↔ e₁ ≠ e₂ :=
        (subcubic_rich_neighbor_five_isolated_vertex_extend_toG_injective G s).ne_iff
      rw [hne]
      apply and_congr_right
      intro _
      constructor
      · rintro ⟨w, hw₁, hw₂⟩
        rw [subcubic_rich_neighbor_five_isolated_vertex_extend_toG, Subtype.coe_mk, Sym2.mem_map] at hw₁ hw₂
        rcases hw₁ with ⟨u₁, hu₁, rfl⟩
        rcases hw₂ with ⟨u₂, hu₂, hu_eq⟩
        have : u₁ = u₂ := Subtype.ext hu_eq.symm
        subst this
        exact ⟨u₁, hu₁, hu₂⟩
      · rintro ⟨u, hu₁, hu₂⟩
        refine ⟨u.val, ?_, ?_⟩
        · rw [subcubic_rich_neighbor_five_isolated_vertex_extend_toG, Subtype.coe_mk, Sym2.mem_map]
          exact ⟨u, hu₁, rfl⟩
        · rw [subcubic_rich_neighbor_five_isolated_vertex_extend_toG, Subtype.coe_mk, Sym2.mem_map]
          exact ⟨u, hu₂, rfl⟩
  6. The edge bijection preserves line graph adjacency, giving a graph isomorphism between the line graphs

    The edge bijection between G minus {v} and G preserves and reflects line graph adjacency, yielding a full graph isomorphism between the line graph of G minus {v} and the line graph of G.

    lines 104–105

    uses subcubic_rich_neighbor_five_isolated_vertex_extend_toG_adj_iff

        intro a b
        exact subcubic_rich_neighbor_five_isolated_vertex_extend_toG_adj_iff G _ a b
  7. An edge is rich under a coloring if and only if its image under a line graph isomorphism is rich under the transported coloring

    An edge is rich when all its line-graph neighbors receive distinct colors. An isomorphism of line graphs maps neighbors to neighbors bijectively and preserves distinctness. Therefore, the neighbor colors of an edge match the neighbor colors of its image under the transported coloring.

    lines 112–131

    uses RelIso.symm_apply_apply

      dsimp [simple_graph_edge_is_rich]
      constructor
      · intro h f₁ g₁ hadj_f hadj_g hne
        have hadj_f₂ : G₂.lineGraph.Adj (iso e₁) (iso f₁) := iso.map_adj_iff.mpr hadj_f
        have hadj_g₂ : G₂.lineGraph.Adj (iso e₁) (iso g₁) := iso.map_adj_iff.mpr hadj_g
        have hne₂ : iso f₁ ≠ iso g₁ := iso.toEquiv.injective.ne hne
        have hdiff := h (iso f₁) (iso g₁) hadj_f₂ hadj_g₂ hne₂
        change c₁ (iso.symm (iso f₁)) ≠ c₁ (iso.symm (iso g₁)) at hdiff
        simp only [RelIso.symm_apply_apply] at hdiff
        exact hdiff
      · intro h f₂ g₂ hadj_f hadj_g hne
        have hadj_f₁ : G₁.lineGraph.Adj e₁ (iso.symm f₂) := by
          have := iso.symm.map_adj_iff.mpr hadj_f
          simpa using this
        have hadj_g₁ : G₁.lineGraph.Adj e₁ (iso.symm g₂) := by
          have := iso.symm.map_adj_iff.mpr hadj_g
          simpa using this
        have hne₁ : iso.symm f₂ ≠ iso.symm g₂ := iso.symm.toEquiv.injective.ne hne
        have hdiff := h (iso.symm f₂) (iso.symm g₂) hadj_f₁ hadj_g₁ hne₁
        exact hdiff
  8. A rich-neighbor coloring of G₁ transports across a line graph isomorphism to a rich-neighbor coloring of G₂

    Given an edge e₂ with a neighbor in G₂, its preimage e₁ has a neighbor in G₁, and hence has a rich neighbor f₁ by the rich-neighbor coloring property in G₁. The image iso f₁ is adjacent to e₂ and is rich by the edge transport lemma.

    lines 138–148

    uses subcubic_rich_neighbor_five_isolated_vertex_extend_rich_edge_transport

      dsimp [simple_graph_is_rich_neighbor_coloring] at hc₁ ⊢
      intro e₂ ⟨f₂, hadj₂⟩
      let e₁ := iso.symm e₂
      have hadj₁ : G₁.lineGraph.Adj e₁ (iso.symm f₂) := by
        have := iso.symm.map_adj_iff.mpr hadj₂
        simpa using this
      obtain ⟨f₁, hadj_f₁, hrich₁⟩ := hc₁ e₁ ⟨iso.symm f₂, hadj₁⟩
      refine ⟨iso f₁, ?_, ?_⟩
      · have := iso.map_adj_iff.mpr hadj_f₁
        simpa [e₁] using this
      · exact (subcubic_rich_neighbor_five_isolated_vertex_extend_rich_edge_transport G₁ G₂ iso c₁ f₁).mpr hrich₁
  9. G admits a rich-neighbor 5-edge-colouring

    From the assumed rich-neighbor 5-edge-colouring c of G minus {v}, we obtain a rich-neighbor 5-edge-colouring of G by transporting c along the line graph isomorphism between G minus {v} and G.

    lines 157–160

    uses subcubic_rich_neighbor_five_isolated_vertex_extend_iso, subcubic_rich_neighbor_five_isolated_vertex_extend_rich_neighbor_transport

      obtain ⟨c, hc⟩ := hc
      let iso := subcubic_rich_neighbor_five_isolated_vertex_extend_iso G v hiso
      exact ⟨c.comp iso.symm.toHom,
        subcubic_rich_neighbor_five_isolated_vertex_extend_rich_neighbor_transport _ _ iso c hc⟩
Sym2.ind
A property holds for every unordered pair if it holds for pairs of the form s(x, y).
Sym2.mem_iff
An element belongs to the unordered pair s(b, c) if and only if it equals b or c.
SimpleGraph.mem_neighborFinset
A vertex w is in the neighbor finset of v if and only if v and w are adjacent.
Finset.card_pos.mpr
A finite set has strictly positive cardinality if and only if it is nonempty.
Sym2.map_mk
Mapping a function f over an unordered pair s(a, b) yields s(f a, f b).
SimpleGraph.mem_edgeSet
An unordered pair s(v, w) belongs to the edge set of G if and only if v and w are adjacent.
Subtype.mk.injEq
Two subtype elements are equal if and only if their underlying values are equal.
Subtype.ext
Two subtype elements are equal if their underlying values are equal.
Sym2.map.injective
If f is an injective function, then Sym2.map f is injective on unordered pairs.
Subtype.val_injective
The canonical projection Subtype.val from a subtype to its ambient type is injective.
subcubic_rich_neighbor_five_isolated_vertex_extend_not_mem_edge
If a vertex v has degree 0 in G, then v does not belong to any edge of G.
SimpleGraph.induce_adj
Two vertices in an induced subgraph are adjacent if and only if their underlying vertices are adjacent in the ambient graph.
SimpleGraph.lineGraph_adj_iff_exists
Two edges are adjacent in the line graph if and only if they are distinct and share a vertex.
subcubic_rich_neighbor_five_isolated_vertex_extend_toG_injective
The canonical map from the edges of an induced subgraph to the edges of the ambient graph is injective.
and_congr_right
To prove an equivalence of conjunctions with the same left conjunct, it suffices to prove the equivalence of the right conjuncts assuming the left conjunct.
Subtype.coe_mk
Coercing a constructed subtype element to the ambient type yields the underlying value.
Sym2.mem_map
An element belongs to the image Sym2.map f z if and only if it is the image under f of some element of z.
subcubic_rich_neighbor_five_isolated_vertex_extend_toG_adj_iff
Two edges in an induced subgraph are adjacent in its line graph if and only if their images in the ambient graph are adjacent in its line graph.
RelIso.symm_apply_apply
Applying the inverse of a relational isomorphism after the isomorphism is the identity.
subcubic_rich_neighbor_five_isolated_vertex_extend_rich_edge_transport
An edge e₁ is rich under coloring c₁ in G₁ if and only if its image under a line graph isomorphism is rich under the transported coloring in G₂.
subcubic_rich_neighbor_five_isolated_vertex_extend_iso
If v has degree 0, the line graph of G minus {v} is isomorphic to the line graph of G.
subcubic_rich_neighbor_five_isolated_vertex_extend_rich_neighbor_transport
A rich-neighbor edge coloring transports across a line graph isomorphism to a rich-neighbor edge coloring.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

lemma subcubic_rich_neighbor_five_isolated_vertex_extend_not_mem_edge {V : Type*}    [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (v : V)    (hiso : G.degree v = 0) (e : G.edgeSet) : ¬ v ∈ (e : Sym2 V) := by  intro hv  rcases e with ⟨e, he⟩  induction e using Sym2.ind with  | h x y =>    rw [Sym2.mem_iff] at hv    rcases hv with rfl | rfl    · have hnb : y ∈ G.neighborFinset v := by        simp only [SimpleGraph.mem_neighborFinset]        exact he      have hpos : 0 < G.degree v := Finset.card_pos.mpr ⟨y, hnb⟩      omega    · have hnb : x ∈ G.neighborFinset v := by        simp only [SimpleGraph.mem_neighborFinset]        exact he.symm      have hpos : 0 < G.degree v := Finset.card_pos.mpr ⟨x, hnb⟩      omegalemma subcubic_rich_neighbor_five_isolated_vertex_extend_to_edgeSet_prop {V : Type*}    (G : SimpleGraph V) (s : Set V) (e : (G.induce s).edgeSet) :    Sym2.map Subtype.val e.1 ∈ G.edgeSet := by  rcases e with ⟨e, he⟩  induction e using Sym2.ind with  | h a b =>    rw [Sym2.map_mk, SimpleGraph.mem_edgeSet]    rw [SimpleGraph.mem_edgeSet] at he    exact hedef subcubic_rich_neighbor_five_isolated_vertex_extend_toG {V : Type*}    (G : SimpleGraph V) (s : Set V) (e : (G.induce s).edgeSet) : G.edgeSet :=  ⟨Sym2.map Subtype.val e.1, subcubic_rich_neighbor_five_isolated_vertex_extend_to_edgeSet_prop G s e⟩lemma subcubic_rich_neighbor_five_isolated_vertex_extend_toG_injective {V : Type*}    (G : SimpleGraph V) (s : Set V) :    Function.Injective (subcubic_rich_neighbor_five_isolated_vertex_extend_toG G s) := by  intro e₁ e₂ h  obtain ⟨e₁, h₁⟩ := e₁  obtain ⟨e₂, h₂⟩ := e₂  simp only [subcubic_rich_neighbor_five_isolated_vertex_extend_toG, Subtype.mk.injEq] at h  exact Subtype.ext (Sym2.map.injective Subtype.val_injective h)lemma subcubic_rich_neighbor_five_isolated_vertex_extend_toG_surjective {V : Type*}    [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (v : V)    (hiso : G.degree v = 0) :    Function.Surjective (subcubic_rich_neighbor_five_isolated_vertex_extend_toG G {w | w ≠ v}) := by  intro ⟨e, he⟩  induction e using Sym2.ind with  | h x y =>    have hxv : x ≠ v := by      intro h      apply subcubic_rich_neighbor_five_isolated_vertex_extend_not_mem_edge G v hiso ⟨s(x, y), he⟩      simp [h]    have hyv : y ≠ v := by      intro h      apply subcubic_rich_neighbor_five_isolated_vertex_extend_not_mem_edge G v hiso ⟨s(x, y), he⟩      simp [h]    let x' : {w | w ≠ v} := ⟨x, hxv⟩    let y' : {w | w ≠ v} := ⟨y, hyv⟩    have he' : s(x', y') ∈ (G.induce {w | w ≠ v}).edgeSet := by      rw [SimpleGraph.mem_edgeSet, SimpleGraph.induce_adj]      exact he    refine ⟨⟨s(x', y'), he'⟩, ?_⟩    apply Subtype.ext    change Sym2.map Subtype.val s(x', y') = s(x, y)    rw [Sym2.map_mk]lemma subcubic_rich_neighbor_five_isolated_vertex_extend_toG_adj_iff {V : Type*}    (G : SimpleGraph V) (s : Set V) (e₁ e₂ : (G.induce s).edgeSet) :    G.lineGraph.Adj (subcubic_rich_neighbor_five_isolated_vertex_extend_toG G s e₁)      (subcubic_rich_neighbor_five_isolated_vertex_extend_toG G s e₂) ↔      (G.induce s).lineGraph.Adj e₁ e₂ := by  rw [SimpleGraph.lineGraph_adj_iff_exists, SimpleGraph.lineGraph_adj_iff_exists]  have hne : subcubic_rich_neighbor_five_isolated_vertex_extend_toG G s e₁ ≠      subcubic_rich_neighbor_five_isolated_vertex_extend_toG G s e₂ ↔ e₁ ≠ e₂ :=    (subcubic_rich_neighbor_five_isolated_vertex_extend_toG_injective G s).ne_iff  rw [hne]  apply and_congr_right  intro _  constructor  · rintro ⟨w, hw₁, hw₂⟩    rw [subcubic_rich_neighbor_five_isolated_vertex_extend_toG, Subtype.coe_mk, Sym2.mem_map] at hw₁ hw₂    rcases hw₁ with ⟨u₁, hu₁, rfl⟩    rcases hw₂ with ⟨u₂, hu₂, hu_eq⟩    have : u₁ = u₂ := Subtype.ext hu_eq.symm    subst this    exact ⟨u₁, hu₁, hu₂⟩  · rintro ⟨u, hu₁, hu₂⟩    refine ⟨u.val, ?_, ?_⟩    · rw [subcubic_rich_neighbor_five_isolated_vertex_extend_toG, Subtype.coe_mk, Sym2.mem_map]      exact ⟨u, hu₁, rfl⟩    · rw [subcubic_rich_neighbor_five_isolated_vertex_extend_toG, Subtype.coe_mk, Sym2.mem_map]      exact ⟨u, hu₂, rfl⟩noncomputable def subcubic_rich_neighbor_five_isolated_vertex_extend_iso {V : Type*}    [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (v : V)    (hiso : G.degree v = 0) :    (G.induce {w | w ≠ v}).lineGraph ≃g G.lineGraph where  toEquiv := Equiv.ofBijective (subcubic_rich_neighbor_five_isolated_vertex_extend_toG G {w | w ≠ v})    ⟨subcubic_rich_neighbor_five_isolated_vertex_extend_toG_injective G _,     subcubic_rich_neighbor_five_isolated_vertex_extend_toG_surjective G v hiso⟩  map_rel_iff' := by    intro a b    exact subcubic_rich_neighbor_five_isolated_vertex_extend_toG_adj_iff G _ a blemma subcubic_rich_neighbor_five_isolated_vertex_extend_rich_edge_transport    {V₁ V₂ α : Type*} (G₁ : SimpleGraph V₁) (G₂ : SimpleGraph V₂)    (iso : G₁.lineGraph ≃g G₂.lineGraph) (c₁ : G₁.lineGraph.Coloring α) (e₁ : G₁.edgeSet) :    simple_graph_edge_is_rich G₂ (c₁.comp iso.symm.toHom) (iso e₁) ↔    simple_graph_edge_is_rich G₁ c₁ e₁ := by  dsimp [simple_graph_edge_is_rich]  constructor  · intro h f₁ g₁ hadj_f hadj_g hne    have hadj_f₂ : G₂.lineGraph.Adj (iso e₁) (iso f₁) := iso.map_adj_iff.mpr hadj_f    have hadj_g₂ : G₂.lineGraph.Adj (iso e₁) (iso g₁) := iso.map_adj_iff.mpr hadj_g    have hne₂ : iso f₁ ≠ iso g₁ := iso.toEquiv.injective.ne hne    have hdiff := h (iso f₁) (iso g₁) hadj_f₂ hadj_g₂ hne₂    change c₁ (iso.symm (iso f₁)) ≠ c₁ (iso.symm (iso g₁)) at hdiff    simp only [RelIso.symm_apply_apply] at hdiff    exact hdiff  · intro h f₂ g₂ hadj_f hadj_g hne    have hadj_f₁ : G₁.lineGraph.Adj e₁ (iso.symm f₂) := by      have := iso.symm.map_adj_iff.mpr hadj_f      simpa using this    have hadj_g₁ : G₁.lineGraph.Adj e₁ (iso.symm g₂) := by      have := iso.symm.map_adj_iff.mpr hadj_g      simpa using this    have hne₁ : iso.symm f₂ ≠ iso.symm g₂ := iso.symm.toEquiv.injective.ne hne    have hdiff := h (iso.symm f₂) (iso.symm g₂) hadj_f₁ hadj_g₁ hne₁    exact hdifflemma subcubic_rich_neighbor_five_isolated_vertex_extend_rich_neighbor_transport    {V₁ V₂ α : Type*} (G₁ : SimpleGraph V₁) (G₂ : SimpleGraph V₂)    (iso : G₁.lineGraph ≃g G₂.lineGraph) (c₁ : G₁.lineGraph.Coloring α)    (hc₁ : simple_graph_is_rich_neighbor_coloring G₁ c₁) :    simple_graph_is_rich_neighbor_coloring G₂ (c₁.comp iso.symm.toHom) := by  dsimp [simple_graph_is_rich_neighbor_coloring] at hc₁ ⊢  intro e₂ ⟨f₂, hadj₂⟩  let e₁ := iso.symm e₂  have hadj₁ : G₁.lineGraph.Adj e₁ (iso.symm f₂) := by    have := iso.symm.map_adj_iff.mpr hadj₂    simpa using this  obtain ⟨f₁, hadj_f₁, hrich₁⟩ := hc₁ e₁ ⟨iso.symm f₂, hadj₁⟩  refine ⟨iso f₁, ?_, ?_⟩  · have := iso.map_adj_iff.mpr hadj_f₁    simpa [e₁] using this  · exact (subcubic_rich_neighbor_five_isolated_vertex_extend_rich_edge_transport G₁ G₂ iso c₁ f₁).mpr hrich₁/-- Deleting an isolated vertex does not change the edge set, so a rich-neighbour 5-edge-colouring of the induced subgraph on the remaining vertices transports to the whole graph. -/theorem subcubic_rich_neighbor_five_isolated_vertex_extend {V : Type*}    [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (v : V)    (hiso : G.degree v = 0)    (hc : ∃ c : (G.induce {w | w ≠ v}).lineGraph.Coloring (Fin 5),      simple_graph_is_rich_neighbor_coloring (G.induce {w | w ≠ v}) c) :    ∃ c : G.lineGraph.Coloring (Fin 5), simple_graph_is_rich_neighbor_coloring G c := by  obtain ⟨c, hc⟩ := hc  let iso := subcubic_rich_neighbor_five_isolated_vertex_extend_iso G v hiso  exact ⟨c.comp iso.symm.toHom,    subcubic_rich_neighbor_five_isolated_vertex_extend_rich_neighbor_transport _ _ iso c hc⟩
See it in the graphDiscuss this resultChallenge it