Exact values of ex( ; \C₃,C₄, ,C_n\)
From MaRDI portal
Publication:608265
DOI10.1016/J.DAM.2010.08.002zbMATH Open1216.05060OpenAlexW1544237479MaRDI QIDQ608265FDOQ608265
Publication date: 25 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.002
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Moore bound for irregular graphs
- Constructions for cubic graphs with large girth
- Title not available (Why is that?)
- Extremal graphs without three‐cycles or four‐cycles
- Graphs with even girth and small excess
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Title not available (Why is that?)
- Graphs with maximum size and lower bounded girth
- Title not available (Why is that?)
- Using simulated annealing to construct extremal graphs
- New families of graphs without short cycles and large size
- On the girth of extremal graphs without shortest cycles
- A Minimal Cubic Graph of Girth Seven
Cited In (7)
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs
- Graphs with maximum size and lower bounded girth
- Constraints for symmetry breaking in graph representation
- 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\)
- Extremal graphs without cycles of length 8 or less
- Size of Graphs with High Girth
This page was built for publication: Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608265)
