New bounds on maximal linkless graphs
Work
Year: 2023
Type: article
Abstract: We construct a family of maximal linklessly embeddable graphs on n vertices and 3n -5 edges for all n ≥ 10, and another family on n vertices and m < 25n 12 -1 4 edges for all n ≥ 13.The latter signifi... more
Source: Algebraic & Geometric Topology
Institutions Occidental College, University of South Alabama
Cites: 12
Cited by: 5
Related to: 10
FWCI: 0.711
Citation percentile (by year/subfield): 52.04
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid