scientific article; zbMATH DE number 109192
From MaRDI portal
Publication:4024328
Recommendations
Cited in
(23)- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- No graph has a maximal 3-ring of bonds
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
- Density of balanced 3-partite graphs without 3-cycles or 4-cycles
- 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\)
- On extremal graphs with bounded girth
- Extremal graphs without cycles of length 8 or less
- On extremal bipartite graphs with high girth
- Size of Graphs with High Girth
- Extremal graphs without four-cycles or five-cycles
- scientific article; zbMATH DE number 89768 (Why is no real title available?)
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs
- Extremal graphs without three‐cycles or four‐cycles
- Graphs with maximum size and lower bounded girth
- scientific article; zbMATH DE number 2170455 (Why is no real title available?)
- Bounds on the Steiner-Wiener index of graphs
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
- New results on EX graphs
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024328)
