On the girth of extremal graphs without shortest cycles

DOI10.1016/J.DISC.2007.10.037zbMath1158.05031OpenAlexW1978339393MaRDI QIDQ998448

A. Diánez, Martín Cera, Camino Balbuena, Pedro García-Vázquez

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.037

zbMATH Keywords

extremal graphsgirthcagesforbidden cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (7)

Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) ⋮ 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 ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\) ⋮ On extremal bipartite graphs with high girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
• Connectivity of Regular Directed Graphs with Small Diameters
• Cages—a survey
• Maximally connected digraphs
• Extremal graphs without three‐cycles or four‐cycles
• On the structure of extremal graphs of high girth
• On the Minimum Order of Extremal Graphs to have a Prescribed Girth

This page was built for publication: On the girth of extremal graphs without shortest cycles