Graphs with maximum size and lower bounded girth
From MaRDI portal
Recommendations
Cites work
- 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
- 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 861311 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- New families of graphs without short cycles and large size
- On the girth of extremal graphs without shortest cycles
- On the Minimum Order of Extremal Graphs to have a Prescribed Girth
- On the structure of extremal graphs of high girth
- The Moore bound for irregular graphs
Cited in
(20)- On erasure combinatorial batch codes
- Extremal edge-girth-regular graphs
- Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\)
- Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\)
- Lower bound for the size of maximal nontraceable graphs
- Bounded-degree graphs can have arbitrarily large slope numbers
- Extremal \(K_4\)-minor-free graphs without short cycles
- On extremal graphs with bounded girth
- PROPERTY A AND GRAPHS WITH LARGE GIRTH
- Sparse matrix feature selection in multi-label learning
- Size of Graphs with High Girth
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs
- scientific article; zbMATH DE number 810049 (Why is no real title available?)
- scientific article; zbMATH DE number 1404133 (Why is no real title available?)
- Extremal graphs with girth nine.
- Extremal size in graphs with bounded degree.
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
- Radius \(r\) extremal graphs of girth 5
- New families of graphs without short cycles and large size
- On the girth of extremal graphs without shortest cycles
This page was built for publication: Graphs with maximum size and lower bounded girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427676)
