Clique minors and the Hadwiger number
Lax342547.CliqueMinor · concepts/Lax342547/CliqueMinor.lean · lax-342547
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
A minor is a family of nonempty connected, pairwise disjoint branch sets, with an edge joining every two distinct branch sets. The Hadwiger number is the largest such for a finite graph.
Concept map
Lean source view on GitHub
| 1 | /- |
| 2 | Adapted from OpenAI, openai/math, commit |
| 3 | adc7f1241b42e322a6451854ab7e4b4c146bf78a (Apache-2.0). |
| 4 | Changes: Lax package separation, namespaces, explicit variables, and archive annotations. |
| 5 | -/ |
| 6 | import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected |
| 7 | import Mathlib.Order.Lattice.Nat |
| 8 | |
| 9 | /-! |
| 10 | --- |
| 11 | title: Clique minors and the Hadwiger number |
| 12 | type: definition |
| 13 | --- |
| 14 | A minor is a family of nonempty connected, pairwise disjoint branch |
| 15 | sets, with an edge joining every two distinct branch sets. The Hadwiger |
| 16 | number is the largest such for a finite graph. |
| 17 | -/ |
| 18 | |
| 19 | namespace Lax342547.CliqueMinor |
| 20 | |
| 21 | def HasCliqueMinor {V : Type} (G : SimpleGraph V) (t : ℕ) : Prop := |
| 22 | ∃ B : Fin t → Set V, |
| 23 | (∀ i, (G.induce (B i)).Connected) ∧ |
| 24 | (∀ i j, i ≠ j → Disjoint (B i) (B j)) ∧ |
| 25 | (∀ i j, i ≠ j → ∃ v ∈ B i, ∃ w ∈ B j, G.Adj v w) |
| 26 | |
| 27 | noncomputable def hadwigerNumber {V : Type} (G : SimpleGraph V) : ℕ := |
| 28 | sSup {t : ℕ | HasCliqueMinor G t} |
| 29 | |
| 30 | |
| 31 | end Lax342547.CliqueMinor |
| 32 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments