Extremal non-bipartite regular graphs of girth 4 (Q5903455)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4021181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal non-bipartite regular graphs of girth 4 |
scientific article; zbMATH DE number 4021181 |
Statements
Extremal non-bipartite regular graphs of girth 4 (English)
0 references
1989
0 references
Let \(f(r)\) denote the smallest number of points in a non-bipartite \(r\)-regular graph of girth 4. \textit{D. Bauer} [J. Comb. Theory, Ser. B, 37, 64-69 (1984; Zbl 0528.05038)] asked whether \(f(25)=66\). We prove that this is so and, more generally, we prove that \(f(4n+1)=10n+6\) \((n\geq 3)\).
0 references
bipartite graph
0 references
regular graph
0 references
girth
0 references
0.812755823135376
0 references
0.7772977948188782
0 references
0.7693047523498535
0 references
