Treewidth is at most feedback vertex number plus one
Lax379983.TreewidthBound · concepts/Lax379983/TreewidthBound.lean · lax-379983
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For every finite undirected simple graph ,
Here treewidth is the least for which a tree decomposition exists with every bag of size at most . The bound also holds for empty and disconnected graphs.
Concept map
Lean source view on GitHub
| 1 | import Lax228581.Treewidth |
| 2 | import Lax379983.FeedbackVertexNumber |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Treewidth is at most feedback vertex number plus one |
| 7 | type: theorem |
| 8 | --- |
| 9 | For every finite undirected simple graph , |
| 10 | |
| 11 | |
| 12 | |
| 13 | Here treewidth is the least for which a tree decomposition exists with |
| 14 | every bag of size at most . The bound also holds for empty and |
| 15 | disconnected graphs. |
| 16 | -/ |
| 17 | |
| 18 | namespace Lax379983.TreewidthBound |
| 19 | |
| 20 | open Lax228581.Treewidth Lax379983.FeedbackVertexNumber |
| 21 | |
| 22 | /-- Every finite simple graph has treewidth at most its feedback vertex number plus one. -/ |
| 23 | axiom treewidth_le_feedbackVertexNumber_add_one {V : Type} [Fintype V] [DecidableEq V] |
| 24 | (G : SimpleGraph V) : treewidth G ≤ feedbackVertexNumber G + 1 |
| 25 | |
| 26 | end Lax379983.TreewidthBound |
| 27 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments