On the Turán Number of Generalized Theta Graphs
From MaRDI portal
Publication:6161259
DOI10.1137/21m1408439zbMath1517.05085arXiv2103.10200MaRDI QIDQ6161259
Publication date: 27 June 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.10200
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Extremal combinatorics (05D99)
Cites Work
- Unnamed Item
- Unnamed Item
- On a class of degenerate extremal graph problems
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Graphs without theta subgraphs
- Cycles of even length in graphs
- A new upper bound on extremal number of even cycles
- Random algebraic construction of extremal graphs
- Turán Numbers of Subdivided Graphs
- Extremal Numbers of Cycles Revisited
- Turán numbers of theta graphs
- Graphs with few paths of prescribed length between any two vertices
- Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’
- The History of Degenerate (Bipartite) Extremal Graph Problems
This page was built for publication: On the Turán Number of Generalized Theta Graphs