English

Intrinsically spherical 3-linked graphs

Combinatorics 2021-07-20 v1

Abstract

We exhibit several families of planar graphs that are minor-minimal intrinsically spherical 33-linked. A graph is intrinsically spherical 3-linked if it is planar graph that has, in every spherical embedding, a non-split 3-link consisting of two disjoint cycles (S1S^1s) and two disjoint vertices (S0S^0), or a cycle and two pairs of disjoint vertices. We conjecture that K4˙K4K_4 \dot{\bigcup} K_4, K3,2˙K3,2K_{3,2} \dot{\bigcup} K_{3,2}, and K4˙K3,2K_4 \dot{\bigcup} K_{3,2} form the complete set of minor-minimal intrinsically type I spherical 3-linked graphs (that is, in every spherical embedding, have a nonsplit link of two cycles and one S0S^0).

Keywords

Cite

@article{arxiv.2107.08953,
  title  = {Intrinsically spherical 3-linked graphs},
  author = {Madeleine Burkhart and Andrew Castillo and Jonathan Doane and Joel Foisy and Cristopher Negron},
  journal= {arXiv preprint arXiv:2107.08953},
  year   = {2021}
}

Comments

24 pages, 54 figures

R2 v1 2026-06-24T04:19:43.755Z