New families of graphs without short cycles and large size
From MaRDI portal
Publication:708348
DOI10.1016/j.dam.2010.03.007zbMath1230.05170OpenAlexW2024784669MaRDI QIDQ708348
E. Abajo, A. Diánez, Camino Balbuena
Publication date: 11 October 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.03.007
Related Items (6)
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 ⋮ Unnamed Item ⋮ Constraints for symmetry breaking in graph representation ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the girth of extremal graphs without shortest cycles
- Constructions of bi-regular cages
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Constructions for cubic graphs with large girth
- 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
- A new series of dense 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: New families of graphs without short cycles and large size
