Graphs with girth at least 5 with orders between 20 and 32

Alice Miller, Michael Codish

Research output: Working paper/PreprintPreprint

Abstract

We prove properties of extremal graphs of girth 5 and order 20 ≤
v ≤ 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for tractable search for and identification of all non isomorphic cases.
Original languageEnglish GB
StatePublished - 23 Aug 2017

Publication series

Namearxiv Math. CO

Keywords

  • Mathematics - Combinatorics

Fingerprint

Dive into the research topics of 'Graphs with girth at least 5 with orders between 20 and 32'. Together they form a unique fingerprint.

Cite this