Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
From MaRDI portal
Publication:1026123
DOI10.1016/j.dam.2007.10.029zbMath1184.05069OpenAlexW2172575773MaRDI QIDQ1026123
Camino Balbuena, Jianmin Tang, Mirka Miller, Yu-qing Lin
Publication date: 24 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.10.029
Related Items (7)
Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) ⋮ New results on EX graphs ⋮ Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs ⋮ Graphs with maximum size and lower bounded girth ⋮ New families of graphs without short cycles and large size ⋮ 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\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the girth of extremal graphs without shortest cycles
- On computing a conditional edge-connectivity of a graph
- Weakly pancyclic graphs
- A note on cycle lengths in graphs
- On the Turán number for the hexagon
- Pancyclic graphs. I
- Connectivity of Regular Directed Graphs with Small Diameters
- Circulants and their connectivities
- Synthesis of reliable networks - a survey
- Graphs without four-cycles
- Maximally connected digraphs
- Extremal graphs without three‐cycles or four‐cycles
- A new series of dense graphs of high girth
- On the structure of extremal graphs of high girth
- On the Minimum Order of Extremal Graphs to have a Prescribed Girth
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On Graphs that do not Contain a Thomsen Graph
- Using simulated annealing to construct extremal graphs
This page was built for publication: Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
