Paperlane

no. 15 · Monday 16 November 2026

A Trivalent Graph of Girth 14 and Order 372

Geoffrey Exoo and Theodore Kolokolnikov

math.CO · v2 · 6 pp

Abstract

The smallest known trivalent graph of girth 14 is constructed. The graph has 372 vertices, improving the old upper bound of 384 \cite{exoo14}. The construction uses methods that may be new to this problem.

comments
6 pages and 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.09000 ↗