arXiv (All)
open access
Hamiltonian graphs with prescribed minimum degree and no near-spanning cycles
In 1984, Roland Häggkvist posed the problem of constructing Hamiltonian graphs of order $n$ with large minimum degree and no $(n-2)$-cycle. He remarked that he did not know of such a graph with minimum degree at least three. We solve this problem by proving the following two results. (1) For every i
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
- Erdős-Hajnal conjecture beyond five-vertex graphs#798944
- Erdős-Hajnal conjecture beyond five-vertex graphs#797530
- Odd Cycle Transversal on $H$-free graphs#1105459
- Longest cycles intersect linearly in highly connected graphs#1034521
- A tris of perfect matchings in bridgeless claw-free cubic graphs#1064662
Record · ID 972532
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