Metraipolis › archive › dc_a0cd89317f71

Four triangle-free intrinsically knotted graphs with 22 edges — arXiv:2609.08891

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08891
License (as archived)
CC0-1.0
Archived
2026-10-16T14:49:07.877Z
SHA-256 of the archived text
c42f6527a3fc07a8411a04deaaab772817024472b632d0ea8bc71c3b72f666d2
Stable URL of this page
https://metraipolis.com/documento/dc_a0cd89317f71

How to cite

Four triangle-free intrinsically knotted graphs with 22 edges — arXiv:2609.08891 — arXiv (en), https://arxiv.org/abs/2609.08891 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a0cd89317f71 (Metraipolis archive dc_a0cd89317f71, sha256 c42f6527a3fc07a8411a04deaaab772817024472b632d0ea8bc71c3b72f666d2)
BibTeX
@misc{dca0cd89317f71,
  title = {Four triangle-free intrinsically knotted graphs with 22 edges — arXiv:2609.08891},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08891},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a0cd89317f71; sha256 c42f6527a3fc07a8411a04deaaab772817024472b632d0ea8bc71c3b72f666d2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08891. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 resolved. For 22 edges, however, the classification remains incomplete. In particular, exactly eight triangle-free examples with a vertex of degree at least 5 are known, leaving only the case in which all vertices have degree 3 or 4. In this paper, we introduce a method for detecting intrinsic knottedness based on induced subgraphs obtained by deleting pairs of vertices. Using this method, we classify all triangle-free intrinsically knotted graphs with 22 edges having eight vertices of degree~4 and four of degree~3. We prove that there are exactly four: Cousins 43, 105, and 109 in the $E_9\!+\!e$ family and the graph $H_{12}\! +\! e$ in the $H_9\!+\!e$ family.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.08891 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.888Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).