A Bound on the Number of Edges in Graphs Without an Even Cycle
From MaRDI portal
Publication:5366930
DOI10.1017/S0963548316000134zbMATH Open1371.05138arXiv1403.1601OpenAlexW1815896765MaRDI QIDQ5366930FDOQ5366930
Authors: Boris Bukh, Zilin Jiang 
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Abstract: We show that, for each fixed , an -vertex graph not containing a cycle of length has at most edges.
Full work available at URL: https://arxiv.org/abs/1403.1601
Recommendations
- A lower bound for the number of edges in a graph containing no two cycles of the same length
- On the maximum number of odd cycles in graphs without smaller odd cycles
- Edge maximal non-bipartite graphs without odd cycles of prescribed lengths
- scientific article; zbMATH DE number 1824729
- scientific article; zbMATH DE number 7144824
- Bounding the number of cycles in a graph in terms of its degree sequence
- Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’
- A note on graphs without short even cycles
- scientific article; zbMATH DE number 3931048
- scientific article; zbMATH DE number 1548426
Cites Work
- Title not available (Why is that?)
- The history of degenerate (bipartite) extremal graph problems
- Title not available (Why is that?)
- What we know and what we do not know about Turán numbers
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- Cycles of even length in graphs
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- 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
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Minimal Regular Graphs of Girths Eight and Twelve
- Title not available (Why is that?)
- Explicit construction of graphs with an arbitrary large girth and of large size
- Constructions of bipartite graphs from finite geometries
Cited In (30)
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Sublinear-time distributed algorithms for detecting small cliques and even cycles
- Degree Ramsey numbers for even cycles
- Graphs without theta subgraphs
- The Ramsey number of a long even cycle versus a star
- Minimum number of edges that occur in odd cycles
- A note on graphs without short even cycles
- On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles
- A new upper bound on extremal number of even cycles
- Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’
- Spectral extremal problem on \(t\) copies of \(\ell\)-cycles
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
- Extremal numbers of hypergraph suspensions of even cycles
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Linear cycles of consecutive lengths
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- The Turán number of directed paths and oriented cycles
- Orthonormal representations of \(H\)-free graphs
- The extremal function for cycles of length \(\ell\) mod \(k\)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- On some cycles in Wenger graphs
- Forbidding induced even cycles in a graph: typical structure and counting
- On 3-uniform hypergraphs without a cycle of a given length
- Cycles in graphs of fixed girth with large size
- Making an H $H$‐free graph k $k$‐colorable
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Cycles of given lengths in hypergraphs
- Title not available (Why is that?)
This page was built for publication: A Bound on the Number of Edges in Graphs Without an Even Cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366930)
