noncomputable def SimpleGraph.largestInducedForestSize {α : Type u_1} (G : SimpleGraph α) : ℕ

largestInducedForestSize G is the size of a largest induced forest of G.

Equations

• G.largestInducedForestSize = sSup {n : ℕ | ∃ (s : Finset α), (SimpleGraph.induce (↑s) G).IsAcyclic ∧ s.card = n}

noncomputable def SimpleGraph.largestInducedBipartiteSubgraphSize {α : Type u_1} (G : SimpleGraph α) : ℕ

largestInducedBipartiteSubgraphSize G is the size of a largest induced bipartite subgraph of G.

Equations

• G.largestInducedBipartiteSubgraphSize = sSup {n : ℕ | ∃ (s : Finset α), (SimpleGraph.induce (↑s) G).IsBipartite ∧ s.card = n}

noncomputable def SimpleGraph.b {α : Type u_1} (G : SimpleGraph α) : ℝ

b G is the number of vertices of a largest induced bipartite subgraph of G. Returned as a real number.

Equations

• G.b = ↑G.largestInducedBipartiteSubgraphSize