Asteroidal triples of cycles
Lax762056.AsteroidalCycles · concepts/Lax762056/AsteroidalCycles.lean · lax-762056
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
An asteroidal triple of cycles consists of three vertex-disjoint, pairwise nonadjacent cycles such that every pair is joined by a path avoiding the closed neighborhood of the third.
Concept map
In the paper
- page 5 of this submission's paper
Lean source view on GitHub
| 1 | import Mathlib.Combinatorics.SimpleGraph.Paths |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Asteroidal triples of cycles |
| 6 | type: definition |
| 7 | --- |
| 8 | An asteroidal triple of cycles consists of three vertex-disjoint, pairwise |
| 9 | nonadjacent cycles such that every pair is joined by a path avoiding the |
| 10 | closed neighborhood of the third. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax762056.AsteroidalCycles |
| 14 | |
| 15 | open SimpleGraph |
| 16 | |
| 17 | def AvoidsClosedNeighborhood {V : Type*} (G : SimpleGraph V) |
| 18 | (S T : Set V) : Prop := |
| 19 | ∀ x ∈ S, ∀ y ∈ T, x ≠ y ∧ ¬ G.Adj x y |
| 20 | |
| 21 | def HasAsteroidalCycleTriple {V : Type*} (G : SimpleGraph V) : Prop := |
| 22 | ∃ (base : Fin 3 → V) (cycle : ∀ i, Walk G (base i) (base i)), |
| 23 | (∀ i, (cycle i).IsCycle) ∧ |
| 24 | (Pairwise fun i j => AvoidsClosedNeighborhood G |
| 25 | {v | v ∈ (cycle i).support} {v | v ∈ (cycle j).support}) ∧ |
| 26 | (∀ i j k, i ≠ j → i ≠ k → j ≠ k → |
| 27 | ∃ u ∈ (cycle i).support, ∃ v ∈ (cycle j).support, |
| 28 | ∃ p : Path G u v, AvoidsClosedNeighborhood G |
| 29 | {x | x ∈ p.val.support} {x | x ∈ (cycle k).support}) |
| 30 | |
| 31 | end Lax762056.AsteroidalCycles |
| 32 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments