Geodesic
The complement of a nIL graph with thirteen vertices is IL
Pavelescu, Andrei1 ; Pavelescu, Elena1
1Department of Mathematics, University of South Alabama, Mobile, AL, United States
Algebraic and Geometric Topology, Tome 20 (2020) no. 1, pp. 395-402
Cet article a éte moissonné depuis la source Mathematical Sciences Publishers

Voir la notice de l'article

We show that for any simple nonoriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.

DOI : 10.2140/agt.2020.20.395
Classification : 57M15, 57M25
Keywords: linklessly embeddable, intrinsically linked, graph complement, de Verdière graph invariant

Pavelescu, Andrei  1   ; Pavelescu, Elena  1

1 Department of Mathematics, University of South Alabama, Mobile, AL, United States 
@article{10_2140_agt_2020_20_395,
     author = {Pavelescu, Andrei and Pavelescu, Elena},
     title = {The complement of a {nIL} graph with thirteen vertices is {IL}},
     journal = {Algebraic and Geometric Topology},
     pages = {395--402},
     year = {2020},
     volume = {20},
     number = {1},
     doi = {10.2140/agt.2020.20.395},
     url = {http://geodesic.mathdoc.fr/articles/10.2140/agt.2020.20.395/}
}
TY  - JOUR
AU  - Pavelescu, Andrei
AU  - Pavelescu, Elena
TI  - The complement of a nIL graph with thirteen vertices is IL
JO  - Algebraic and Geometric Topology
PY  - 2020
SP  - 395
EP  - 402
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.2140/agt.2020.20.395/
DO  - 10.2140/agt.2020.20.395
ID  - 10_2140_agt_2020_20_395
ER  - 
%0 Journal Article
%A Pavelescu, Andrei
%A Pavelescu, Elena
%T The complement of a nIL graph with thirteen vertices is IL
%J Algebraic and Geometric Topology
%D 2020
%P 395-402
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.2140/agt.2020.20.395/
%R 10.2140/agt.2020.20.395
%F 10_2140_agt_2020_20_395
Pavelescu, Andrei; Pavelescu, Elena. The complement of a nIL graph with thirteen vertices is IL. Algebraic and Geometric Topology, Tome 20 (2020) no. 1, pp. 395-402. doi: 10.2140/agt.2020.20.395

[1] J Battle, F Harary, Y Kodama, Every planar graph with nine points has a nonplanar complement, Bull. Amer. Math. Soc. 68 (1962) 569 | DOI

[2] J Campbell, T W Mattman, R Ottman, J Pyzer, M Rodrigues, S Williams, Intrinsic knotting and linking of almost complete graphs, Kobe J. Math. 25 (2008) 39

[3] Y Colin De Verdière, Sur un nouvel invariant des graphes et un critère de planarité, J. Combin. Theory Ser. B 50 (1990) 11 | DOI

[4] J H Conway, C M Gordon, Knots and links in spatial graphs, J. Graph Theory 7 (1983) 445 | DOI

[5] A Kotlov, L Lovász, S Vempala, The Colin de Verdière number and sphere representations of a graph, Combinatorica 17 (1997) 483 | DOI

[6] L Lovász, A Schrijver, A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs, Proc. Amer. Math. Soc. 126 (1998) 1275 | DOI

[7] N Robertson, P D Seymour, R Thomas, Linkless embeddings of graphs in 3–space, Bull. Amer. Math. Soc. 28 (1993) 84 | DOI

[8] H Sachs, On spatial representations of finite graphs, from: "Finite and infinite sets, II" (editors A Hajnal, L Lovász, V T Sós), Colloq. Math. Soc. János Bolyai 37, North-Holland (1984) 649

Cité par Sources :