On the Number of Edges in Maximally Linkless Graphs
Abstract
A maximally linkless graph is a graph that can be embedded in R3 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 m=3n-3 edges. We improve upon this by demonstrating a new family of maximally linkless graphs with m 145n edges.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.