Lax17.StrongTreeOfSetsConstruction
Strong tree-of-sets construction
concepts/Lax17/StrongTreeOfSetsConstruction.lean · lax-17
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
Theorem
A sufficiently large node-well-linked set supports a strong subcubic tree-of-sets system.
Lean source view on GitHub
| 1 | import Mathlib.Data.Nat.Log |
| 2 | import Lax17.TreeOfSets |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Strong tree-of-sets construction |
| 7 | type: theorem |
| 8 | --- |
| 9 | A sufficiently large node-well-linked set supports a strong subcubic |
| 10 | tree-of-sets system. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax17.StrongTreeOfSetsConstruction |
| 14 | |
| 15 | universe u |
| 16 | |
| 17 | /-- A sufficiently large node-well-linked set supports a strong subcubic |
| 18 | tree-of-sets system. -/ |
| 19 | axiom strongTreeOfSetsConstruction : |
| 20 | ∃ c d p : ℕ, 0 < c ∧ 0 < d ∧ 0 < p ∧ |
| 21 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 22 | (G : SimpleGraph V) (X : Finset V) {m w x Δ : ℕ}, |
| 23 | 1 < m → |
| 24 | 1 < w → |
| 25 | 1 < x → |
| 26 | Lax17.Degree.MaximumAtMost G Δ → |
| 27 | X.card = x → |
| 28 | Lax17.Linkedness.NodeWellLinkedIn G Finset.univ X → |
| 29 | c * w * m ^ 24 * Δ ^ p * |
| 30 | (Nat.log 2 x) ^ d < x → |
| 31 | Nonempty (Lax17.TreeOfSets.StrongSystem G m w) |
| 32 | |
| 33 | end Lax17.StrongTreeOfSetsConstruction |
| 34 |
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments