Exactly fourteen intrinsically knotted graphs have 21 edges

Minjung Lee, Hyoungjun Kim, Hwa Jeong Lee, Seung Sang Oh

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Johnson, Kidwell, and Michael showed that intrinsically knotted graphs have at least 21 edges. Also it is known that K7 and the thirteen graphs obtained from K7 by ∇Y moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.

Original languageEnglish
Pages (from-to)3305-3322
Number of pages18
JournalAlgebraic and Geometric Topology
Volume15
Issue number6
DOIs
Publication statusPublished - 2016 Jan 12

Fingerprint

Graph in graph theory

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Exactly fourteen intrinsically knotted graphs have 21 edges. / Lee, Minjung; Kim, Hyoungjun; Lee, Hwa Jeong; Oh, Seung Sang.

In: Algebraic and Geometric Topology, Vol. 15, No. 6, 12.01.2016, p. 3305-3322.

Research output: Contribution to journalArticle

Lee, Minjung ; Kim, Hyoungjun ; Lee, Hwa Jeong ; Oh, Seung Sang. / Exactly fourteen intrinsically knotted graphs have 21 edges. In: Algebraic and Geometric Topology. 2016 ; Vol. 15, No. 6. pp. 3305-3322.
@article{a257796dd5f64d9abeb0c02ff1a0be06,
title = "Exactly fourteen intrinsically knotted graphs have 21 edges",
abstract = "Johnson, Kidwell, and Michael showed that intrinsically knotted graphs have at least 21 edges. Also it is known that K7 and the thirteen graphs obtained from K7 by ∇Y moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.",
author = "Minjung Lee and Hyoungjun Kim and Lee, {Hwa Jeong} and Oh, {Seung Sang}",
year = "2016",
month = "1",
day = "12",
doi = "10.2140/agt.2015.15.3305",
language = "English",
volume = "15",
pages = "3305--3322",
journal = "Algebraic and Geometric Topology",
issn = "1472-2747",
publisher = "Agriculture.gr",
number = "6",

}

TY - JOUR

T1 - Exactly fourteen intrinsically knotted graphs have 21 edges

AU - Lee, Minjung

AU - Kim, Hyoungjun

AU - Lee, Hwa Jeong

AU - Oh, Seung Sang

PY - 2016/1/12

Y1 - 2016/1/12

N2 - Johnson, Kidwell, and Michael showed that intrinsically knotted graphs have at least 21 edges. Also it is known that K7 and the thirteen graphs obtained from K7 by ∇Y moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.

AB - Johnson, Kidwell, and Michael showed that intrinsically knotted graphs have at least 21 edges. Also it is known that K7 and the thirteen graphs obtained from K7 by ∇Y moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.

UR - http://www.scopus.com/inward/record.url?scp=84957084716&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957084716&partnerID=8YFLogxK

U2 - 10.2140/agt.2015.15.3305

DO - 10.2140/agt.2015.15.3305

M3 - Article

AN - SCOPUS:84957084716

VL - 15

SP - 3305

EP - 3322

JO - Algebraic and Geometric Topology

JF - Algebraic and Geometric Topology

SN - 1472-2747

IS - 6

ER -