Feedback vertex number is at most feedback edge number
Lax379983.FeedbackNumberComparison · concepts/Lax379983/FeedbackNumberComparison.lean · lax-379983
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For every finite undirected simple graph ,
No connectedness or nonemptiness assumption is required.
Concept map
Lean source view on GitHub
| 1 | import Lax379983.FeedbackVertexNumber |
| 2 | import Lax379983.FeedbackEdgeNumber |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Feedback vertex number is at most feedback edge number |
| 7 | type: theorem |
| 8 | --- |
| 9 | For every finite undirected simple graph , |
| 10 | |
| 11 | |
| 12 | |
| 13 | No connectedness or nonemptiness assumption is required. |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax379983.FeedbackNumberComparison |
| 17 | |
| 18 | open Lax379983.FeedbackVertexNumber Lax379983.FeedbackEdgeNumber |
| 19 | |
| 20 | /-- Every finite simple graph has feedback vertex number at most its feedback edge number. -/ |
| 21 | axiom feedbackVertexNumber_le_feedbackEdgeNumber {V : Type*} [Finite V] |
| 22 | (G : SimpleGraph V) : feedbackVertexNumber G ≤ feedbackEdgeNumber G |
| 23 | |
| 24 | end Lax379983.FeedbackNumberComparison |
| 25 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments