preprint · arXiv (Cornell University) · 2026

Minimal 3-regular Penny Graph

Cited by 0Open access

Abstract

We prove that a 3-regular penny graph has at least 16 vertices and show that such a graph with 16 vertices exists.

Cite this paper

Karabegov, A., & Khovanova, T. (2026). Minimal 3-regular Penny Graph. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2602.01287

MLA 9

Karabegov, Alexander, and Tanya Khovanova. “Minimal 3-regular Penny Graph.” arXiv (Cornell University), 2026, https://doi.org/10.48550/arxiv.2602.01287.

Chicago

Karabegov, Alexander, and Tanya Khovanova. 2026. “Minimal 3-regular Penny Graph.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2602.01287.

Harvard

Karabegov, A. and Khovanova, T. (2026) ‘Minimal 3-regular Penny Graph’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.2602.01287.

BibTeX

@misc{karabegov2026minimal,
  title = {{Minimal 3-regular Penny Graph}},
  author = {Karabegov, Alexander and Khovanova, Tanya},
  journal = {arXiv (Cornell University)},
  year = {2026},
  doi = {10.48550/arxiv.2602.01287}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.