Minimal Pancyclicity

MaRDI QIDQ6246917zbMATH OpenFDO

Authors Sean Griffin

Publication date 1 December 2013

Abstract: A pancyclic graph is a simple graph containing a cycle of length $k$ for all $3leqkleqn$. Let $m(n)$ be the minimum number of edges of all pancyclic graphs on $n$ vertices. Exact values are given for $m(n)$ for $nleq37$, combining calculations from an exhaustive search on graphs with up to 29 vertices with a construction that works for up to 37 vertices. The behavior of $m(n)$ in general is also explored, including a proof of the conjecture that $m(n+1)>m(n)$ for all $n$ in some special cases.

This page was built for publication: Minimal Pancyclicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6246917)