Lax Lean Archive

Feedback vertex number

Lax379983.FeedbackVertexNumber · concepts/Lax379983/FeedbackVertexNumber.lean · lax-379983

definition

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Definition

    Let G=(V,E)G=(V,E) be a finite undirected simple graph. A feedback vertex set is a set S⊆VS\subseteq V for which the induced graph G[V∖S]G[V\setminus S] is acyclic. The feedback vertex number is

    FVN⁡(G)=min⁡{∣S∣:S⊆V,  G[V∖S] is acyclic}.\operatorname{FVN}(G)=\min\{\lvert S\rvert : S\subseteq V,\; G[V\setminus S]\text{ is acyclic}\}.

    The minimum exists because deleting all vertices leaves an acyclic graph.

    Concept map
    1 concept; 2 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    In the paper

    Lean source view on GitHub

    1import Mathlib.Combinatorics.SimpleGraph.Acyclic
    2import Mathlib.Data.Nat.Lattice
    3import Mathlib.Data.Set.Card
    4
    5/-!
    6---
    7title: Feedback vertex number
    8type: definition
    9---
    10Let G=(V,E)G=(V,E) be a finite undirected simple graph. A feedback vertex set is a
    11set S⊆VS\subseteq V for which the induced graph G[V∖S]G[V\setminus S] is acyclic.
    12The feedback vertex number is
    13
    14FVN⁡(G)=min⁡{∣S∣:S⊆V,  G[V∖S] is acyclic}.\operatorname{FVN}(G)=\min\{\lvert S\rvert : S\subseteq V,\; G[V\setminus S]\text{ is acyclic}\}.
    15
    16
    17The minimum exists because deleting all vertices leaves an acyclic graph.
    18-/
    19
    20namespace Lax379983.FeedbackVertexNumber
    21
    22/-- The minimum number of vertices whose deletion makes the graph acyclic. -/
    23noncomputable def feedbackVertexNumber {V : Type*} [Finite V] (G : SimpleGraph V) : ℕ :=
    24 sInf {n : ℕ | ∃ S : Set V, S.ncard = n ∧ (G.induce Sᶜ).IsAcyclic}
    25
    26end Lax379983.FeedbackVertexNumber
    27
    Builds on

    none

    Used by
    From Mathlib

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…