Lax17.TerminalElementMenger
Terminal element-Menger theorem
concepts/Lax17/TerminalElementMenger.lean · lax-17
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Theorem
For a named-edge multigraph, the canonical available-boundary formulation of terminal element-connectivity is equivalent to the usual formulation by arbitrary terminal element cuts.
Lean source view on GitHub
| 1 | import Lax17.TerminalConnectivity |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Terminal element-Menger theorem |
| 6 | type: theorem |
| 7 | --- |
| 8 | For a named-edge multigraph, the canonical available-boundary formulation of |
| 9 | terminal element-connectivity is equivalent to the usual formulation by |
| 10 | arbitrary terminal element cuts. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax17.TerminalElementMenger |
| 14 | |
| 15 | universe u |
| 16 | |
| 17 | /-- Terminal element-connectivity in arbitrary-cut form. -/ |
| 18 | axiom terminalElementMenger : |
| 19 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 20 | (H : Lax17.TerminalConnectivity.EdgeIndexedGraph V) |
| 21 | (terminals : Finset V) (k : ℕ), |
| 22 | H.TerminalElementConnectedAtLeast terminals k ↔ |
| 23 | ∀ ⦃a : V⦄, a ∈ terminals → |
| 24 | ∀ ⦃b : V⦄, b ∈ terminals → a ≠ b → |
| 25 | ∀ C : H.ElementCut terminals a b, k ≤ C.order |
| 26 | |
| 27 | end Lax17.TerminalElementMenger |
| 28 |
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