arXiv (All)
open access
Degree conditions for $k$-strong orientations of digraphs
Jackson and Thomassen conjectured that every $2k$-strong digraph contains a spanning $k$-strong oriented subdigraph. We prove sharp degree conditions for the existence of such a subdigraph. For every fixed positive integer $k$ and all sufficiently large $n$, every $n$-vertex digraph $D$ with $δ^0(D)
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
- The Erdős-Hajnal Property for the six-vertex Graph with Edge Set $\{ab,bc,cd,de,af,bf,df\}$#792548
- The Erdős-Hajnal Property for the six-vertex Graph with Edge Set $\{ab,bc,cd,de,af,bf,df\}$#788548
- A linear bound for nested cycles without geometric crossings#985258
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- A Polynomial Kernel for Planar Directed Feedback Vertex Set#1049406
Record · ID 1131752
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