## 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.

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 language | English GB |
---|---|

State | Published - 23 Aug 2017 |

### Publication series

Name | arxiv Math. CO |
---|

## Keywords

- Mathematics - Combinatorics