arXiv (All)
open access
New Snake-in-the-Box Records via Snakepit Surgery and Learned Construction
The snake-in-the-box problem asks for a longest induced path in the hypercube graph $Q_n$. We find a length-191 snake in dimension $n=9$, the lowest dimension where the maximum is unknown, improving the previous record of 190 that had stood for 14 years. We also establish new lower bounds in dimensi
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 Davenport–Heilbronn method: 80 years on#392156
- Superlinear Quantum Query Lower Bounds for Subgraph Detection#1154524
- 20 U.S.C. § 80q-3 — Board of Trustees of National Museum of the American Indian#576683
- From finite to infinite length modules over tame hereditary algebras#819355
- From finite to infinite length modules over tame hereditary algebras#809362
Record · ID 1144846
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