Extremal Numbers for Odd Cycles
From MaRDI portal
Publication:5364245
DOI10.1017/S0963548314000601zbMath1371.05142arXiv1310.6766OpenAlexW3099192033WikidataQ114116557 ScholiaQ114116557MaRDI QIDQ5364245
Zoltan Fueredi, David S. Gundersson
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.6766
Related Items (19)
The Turán number of disjoint copies of paths ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ Outerplanar Turán numbers of cycles and paths ⋮ Turán numbers for disjoint paths ⋮ A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs ⋮ Triangle-free graphs with the maximum number of cycles ⋮ Maximizing the degree powers of graphs with fixed size ⋮ Extremal results for \(C_3^-\)-free signed graphs ⋮ Large induced subgraphs with three repeated degrees ⋮ Unnamed Item ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ A spectral condition for odd cycles in non-bipartite graphs ⋮ Unavoidable hypergraphs ⋮ An Erdős-Gallai type theorem for vertex colored graphs ⋮ A spectral condition for the existence of a pentagon in non-bipartite graphs ⋮ On the Turán number of theta graphs ⋮ The Turán number of the square of a path ⋮ Spectral extrema of graphs: forbidden hexagon ⋮ Extremal graphs for two vertex-disjoint copies of a clique
Cites Work
- Unnamed Item
- Unnamed Item
- A note on Turán numbers for even wheels
- A sufficient condition for all short cycles
- Path Ramsey numbers in multicolorings
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Pancyclic graphs. I
- Large cycles in graphs
- On maximal paths and circuits of graphs
- Maximal circuits of graphs. I
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Sufficient Conditions for Circuits in Graphs†
- On the theory of graphs
This page was built for publication: Extremal Numbers for Odd Cycles
