Graphs with maximum size and lower bounded girth
From MaRDI portal
Publication:427676
DOI10.1016/J.AML.2011.09.062zbMath1243.05119OpenAlexW2039162903MaRDI QIDQ427676
Publication date: 14 June 2012
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.09.062
Related Items (6)
Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\) ⋮ Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) ⋮ Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs ⋮ Sparse Matrix Feature Selection in Multi-label Learning ⋮ On erasure combinatorial batch codes ⋮ 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
- 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
- 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: Graphs with maximum size and lower bounded girth