On the number of edges in maximally linkless graphs
Max Aires · Journal of Graph Theory · 2021
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. Recently, a family of ‐vertex maximally linkless graphs was found with edges. We improve upon this by demonstrating a new family of maximally linkless graphs with at most edges.