arXiv (All)
open access
A quadratic refinement of Jackson's \CE\ condition for Hamilton cycles in digraphs
For a digraph $D$, let $α_2(D)$ be the largest size of a vertex set no two of whose vertices lie in a common directed $2$-cycle. Let $f_2(a)$ be the least integer $K$ such that every $K$-connected digraph $D$ with $α_2(D)\le a$ has a Hamilton cycle. Jackson proved in 1987 that $f_2(a)\le2^a(a+2)!$,
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
- A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2}=4$#793324
- A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2}=4$#789320
- A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound#974019
- Square products of factorials and a conjecture of Erdős and Graham#1157170
- An FPT algorithm for cycle rank on semi-complete digraphs#1062946
Record · ID 1048687
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