arXiv (All)
open access
Nowhere-zero $3$-flows in graphs with forbidden edge-cuts
Tutte's $3$-flow conjecture asserts that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. In 2013, Lovász, Thomassen, Wu, and Zhang proved that every odd-$7$-edge-connected graph admits a nowhere-zero $3$-flow; consequently, the conjecture holds for $4$-edge-connected graphs with no ed
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
- Nowhere-zero $3$-flows in Cayley graphs on solvable groups of twice square-free order#1104990
- Schnorr Non-interactive Zero-Knowledge Proof#399347
- Non-homotopic drawings of multigraphs#228164
- Quagmires and large Suslin forests#792506
- Quagmires and large Suslin forests#788506
Record · ID 985734
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