A Bound on the Number of Edges in Graphs Without an Even Cycle
From MaRDI portal
Publication:5366930
DOI10.1017/S0963548316000134zbMath1371.05138arXiv1403.1601OpenAlexW1815896765MaRDI QIDQ5366930
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.1601
Related Items (25)
Graphs without theta subgraphs ⋮ Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ Degree Ramsey numbers for even cycles ⋮ Linear cycles of consecutive lengths ⋮ A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles ⋮ The Ramsey number of a long even cycle versus a star ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ Orthonormal representations of \(H\)-free graphs ⋮ The Turán number of directed paths and oriented cycles ⋮ Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’ ⋮ Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ On some cycles in Wenger graphs ⋮ The extremal function for cycles of length \(\ell\) mod \(k\) ⋮ On 3-uniform hypergraphs without a cycle of a given length ⋮ Cycles in graphs of fixed girth with large size ⋮ A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints ⋮ Cycles of given lengths in hypergraphs ⋮ A new upper bound on extremal number of even cycles ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Hypergraphs with Few Berge Paths of Fixed Length between Vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Cycles of even length in graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- What we know and what we do not know about Turán numbers
- On the Turán number for the hexagon
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- Constructions of bipartite graphs from finite geometries
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Minimal Regular Graphs of Girths Eight and Twelve
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
This page was built for publication: A Bound on the Number of Edges in Graphs Without an Even Cycle
