arXiv (All)
open access
Breaking the Exponential Barrier: The First Polynomial-Time Algorithm for the Győri-Lovász Theorem
We give the first polynomial-time algorithm, after half a century, for the celebrated Győri-Lovász theorem, which resolved a conjecture of Frank (1975). The theorem, one of the simplest existential theorems to explain, states that every $k$-connected graph can be partitioned into $k$ disjoint connec
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Breaking the Exponential Barrier: The First Polynomial-Time Algorithm for the Győri-Lovász Theorem#808995
- A Note on the Invertibility of Oriented Graphs#628825
- Connectivity keeping pendant extensions of paths in $k$-connected graphs and triangle-free graphs#1049373
- The Erdős-Pósa Property for Colorful Minors#971921
- Partitions of Planar (Oriented) Graphs into a Connected Acyclic and an Independent Set#333910
Record · ID 818987
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive