arXiv (All)
open access
Four triangle-free intrinsically knotted graphs with 22 edges
An intrinsically knotted graph is one for which every spatial embedding contains a nontrivially knotted cycle. Classifying such graphs is a central problem in spatial graph theory. It is known that every intrinsically knotted graph has at least 21 edges, and the case of 21 edges has been completely
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
- Boolean building set arrangements#1036263
- Almost Linear 3-Spanners of Temporal Cliques#924970
- Almost Linear 3-Spanners of Temporal Cliques#920736
- Sample Complexity of Correlation Detection in Erdős-Rényi graphs#821772
- k-Clique counting on large scale-graphs: a survey#650011
Record · ID 986516
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