Girth of \C₃, , C_s\-free extremal graphs
From MaRDI portal
Publication:423957
Recommendations
Cites work
- scientific article; zbMATH DE number 109192 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 743695 (Why is no real title available?)
- scientific article; zbMATH DE number 3432305 (Why is no real title available?)
- scientific article; zbMATH DE number 3412694 (Why is no real title available?)
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
- Extremal graphs without three‐cycles or four‐cycles
- Graphs with maximum size and lower bounded girth
- Minimal Regular Graphs of Girths Eight and Twelve
- New families of graphs without short cycles and large size
- On Moore Graphs with Diameters 2 and 3
- On the Minimum Order of Extremal Graphs to have a Prescribed Girth
- On the girth of extremal graphs without shortest cycles
- On the structure of extremal graphs of high girth
- The Moore bound for irregular graphs
- The nonexistence of certain generalized polygons
- Using simulated annealing to construct extremal graphs
Cited in
(4)- On the girth of extremal graphs without shortest cycles
- Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\)
- On the Minimum Order of Extremal Graphs to have a Prescribed Girth
- scientific article; zbMATH DE number 915258 (Why is no real title available?)
This page was built for publication: Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423957)