On the Minimum Order of Extremal Graphs to have a Prescribed Girth

DOI10.1137/060656747zbMath1154.05040OpenAlexW2022293443MaRDI QIDQ5454275

Camino Balbuena, Pedro García-Vázquez

Publication date: 28 March 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle/11441/57152

zbMATH Keywords

cyclediametergirthloopregular graphcageedgeextremal graphvertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

Size of Graphs with High Girth ⋮ Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs ⋮ Graphs with maximum size and lower bounded girth ⋮ New families of graphs without short cycles and large size ⋮ On the girth of extremal graphs without shortest cycles ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)

This page was built for publication: On the Minimum Order of Extremal Graphs to have a Prescribed Girth