New bounds on maximal linkless graphs

DOI10.2140/agt.2023.23.2545arXiv2007.10522OpenAlexW3044911025MaRDI QIDQ6148480

Ramin Naimi, Andrei Pavelescu, Elena Pavelescu

Publication date: 11 January 2024

Published in: Algebraic \& Geometric Topology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.10522

zbMATH Keywords

clique sumsmaximal linkless graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (1)

Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant

Cites Work

• A splitter for graphs with no Petersen family minor
• Non-separating planar graphs
• Homomorphiesätze für Graphen
• Knots and links in spatial graphs
• A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
• Linkless embeddings of graphs in 3-space
• On the number of edges in maximally linkless graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New bounds on maximal linkless graphs