|
|||||
|
|
|
|
|
|
|
|
|
|
|
|
|
The complement of a nIL
graph with thirteen vertices is IL
Andrei Pavelescu and Elena Pavelescu |
|
Algebraic & Geometric Topology 20 (2020) 395–402
|
Abstract |
|
We show that for any simple nonoriented graph with at least thirteen vertices either or its complement is intrinsically linked. |
PDF Access Denied
We have not been able to recognize your IP address
13.59.113.226
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 40.00:
Keywords
linklessly embeddable, intrinsically linked, graph
complement, de Verdière graph invariant
|
Mathematical Subject Classification 2010
Primary: 57M15, 57M25
|
References |
Publication
Received: 30 October 2018
Revised: 13 March 2019
Accepted: 9 April 2019
Published: 23 February 2020
|
Authors |
| Andrei Pavelescu | |
| Department of Mathematics University of South Alabama Mobile, AL United States |
|
| Elena Pavelescu | |
| Department of Mathematics University of South Alabama Mobile, AL United States |
|
