arXiv (All)
open access
Directed Hamiltonicity in Generalized Kneser Graphs
We prove that the canonical orientation of the generalized Kneser graph $KG(n,k,s)$ contains a directed Hamiltonian cycle for all integers $s \geq 3$ and $n>sk$. Furthermore, we establish that the dichromatic number of this oriented graph is exactly $k$. As a special case, our results apply to the $
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
- k-Coloring is Faster than Computing the Chromatic Number#987763
- Acyclic and oriented chromatic numbers of graphs#490219
- On the edge contraction spectrum of some families of graphs#356315
- The b-chromatic number of a graph#652634
- Generalized Sterboul--Deming Configurations#1000095
Record · ID 1116164
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