On the Number of Edges in Maximally Linkless Graphs
Combinatorics
2019-11-21 v1 Geometric Topology
Abstract
A maximally linkless graph is a graph that can be embedded in without any links, but cannot be embedded in such a way if any other edge is added to the graph. Recently, a family of maximally linkless graphs was found with edges. We improve upon this by demonstrating a new family of maximally linkless graphs with edges.
Cite
@article{arxiv.1911.08552,
title = {On the Number of Edges in Maximally Linkless Graphs},
author = {Max Aires},
journal= {arXiv preprint arXiv:1911.08552},
year = {2019}
}
Comments
4 pages, 1 figure