Premium
On the number of edges in maximally linkless graphs
Author(s) -
Aires Max
Publication year - 2021
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22703
Subject(s) - combinatorics , mathematics , vertex (graph theory) , graph , 1 planar graph , discrete mathematics , symmetric graph , chordal graph , line graph , voltage graph
A maximally linkless graph is a graph that can be embedded in R 3 without any links, but cannot be embedded in such a way if any other edge is added. Recently, a family of n ‐vertex maximally linkless graphs was found with 3 n − 3 edges. We improve upon this by demonstrating a new family of maximally linkless graphs with at most 14 5 n edges.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom