We discuss the problem of finding smallest graphs of given girth g and valency v (( v, g )‐cages). All known ( v, g )‐cages are given. Different variations of the cage problem are also discussed.
No takes yet. Share an insight, caveat, or question.
Pak‐Ken Wong (1982) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: