Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs

DOI10.1016/j.dam.2012.01.020zbMath1243.05118OpenAlexW1819560410MaRDI QIDQ423957

A. Diánez, E. Abajo, Camino Balbuena

Publication date: 30 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.020

zbMATH Keywords

girthextremal functionextremal graphdegree of an edge

Mathematics Subject Classification ID

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

Related Items (1)

Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with maximum size and lower bounded girth
• Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
• 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\})\)
• The Moore bound for irregular graphs
• The nonexistence of certain generalized polygons
• On Moore Graphs with Diameters 2 and 3
• 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
• Minimal Regular Graphs of Girths Eight and Twelve
• Using simulated annealing to construct extremal graphs

This page was built for publication: Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs