Lax57.AnticomponentBlockade
Anticomponent or complete blockade
concepts/Lax57/AnticomponentBlockade.lean · lax-57
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Theorem
This denominator-cleared form of Lemma 4.1 groups the connected components of the complement. Either one anticonnected component has size at least , or there are pairwise complete groups, each of size at least .
Lean source view on GitHub
| 1 | import Lax57.GraphDefinitions |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Anticomponent or complete blockade |
| 6 | type: theorem |
| 7 | --- |
| 8 | This denominator-cleared form of Lemma 4.1 groups the connected components |
| 9 | of the complement. Either one anticonnected component has size at least |
| 10 | , or there are pairwise complete groups, each of size at least |
| 11 | . |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax57.AnticomponentBlockade |
| 15 | |
| 16 | open Lax57.GraphDefinitions |
| 17 | |
| 18 | universe u |
| 19 | |
| 20 | /-- A large anticonnected component or a long complete blockade. -/ |
| 21 | axiom anticomponent_or_complete_blockade : |
| 22 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 23 | (G : SimpleGraph V) [DecidableRel G.Adj] (T : Finset V) (Q : ℕ), |
| 24 | 2 ≤ Q → |
| 25 | ( (∃ J : Finset V, J ⊆ T ∧ |
| 26 | (Gᶜ.induce (J : Set V)).Connected ∧ |
| 27 | T.card ≤ Q ^ 2 * J.card) ∨ |
| 28 | (∃ C : Blockade (V := V) Q, |
| 29 | C.IsInside T ∧ C.IsComplete G ∧ |
| 30 | ∀ i : Fin Q, |
| 31 | T.card ≤ 4 * Q ^ 3 * (C.block i).card) ) |
| 32 | |
| 33 | end Lax57.AnticomponentBlockade |
| 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