Highly connected orientations from edge-disjoint rigid subgraphs
We give an affirmative answer to a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a k-vertex-connected orientation. We prove that a connectivity of order $O(k^2)$ suffices. As a key tool, we show that for every pair of positive integers d and...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press
2025-01-01
|
| Series: | Forum of Mathematics, Pi |
| Subjects: | |
| Online Access: | https://www.cambridge.org/core/product/identifier/S2050508625000046/type/journal_article |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|