A note on the Turán function of even cycles

DOI10.1090/S0002-9939-2012-11274-2zbMath1270.05061WikidataQ56698342 ScholiaQ56698342MaRDI QIDQ2846723

Oleg Pikhurko

Publication date: 3 September 2013

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

\(F\)-free graphcycle of length 2Turan function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Arithmetic progressions (11B25)

Related Items (31)

The number of \(C_{2\ell}\)-free graphs ⋮ Turán function and \(H\)-decomposition problem for gem graphs ⋮ On small balanceable, strongly-balanceable and omnitonal graphs ⋮ Deterministic Subgraph Detection in Broadcast CONGEST. ⋮ Linear cycles of consecutive lengths ⋮ On the spectrum of Wenger graphs ⋮ Distance colouring without one cycle length ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ A Bound on the Number of Edges in Graphs Without an Even Cycle ⋮ Triangles in graphs without bipartite suspensions ⋮ The Turán number of directed paths and oriented cycles ⋮ Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs ⋮ Decomposition of bounded degree graphs into \(C_4\)-free subgraphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ 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 ⋮ 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 ⋮ Distance Colouring Without One Cycle Length ⋮ The lower and upper bounds of Turán number for odd wheels ⋮ On an extremal hypergraph problem related to combinatorial batch codes ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ Hypergraphs with Few Berge Paths of Fixed Length between Vertices ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ Turán numbers of theta graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• Polarities and \(2k\)-cycle-free graphs
• Properties of certain families of \(2k\)-cycle-free graphs
• Graphs without quadrilaterals
• Compactness results in extremal graph theory
• Cycles of even length in graphs
• LDPC codes from triangle-free line sets
• Explicit construction of graphs with an arbitrary large girth and of large size
• On the number of edges of quadrilateral-free graphs
• On the Turán number for the hexagon
• On Arithmetic Progressions of Cycle Lengths in Graphs
• Graphs without four-cycles
• Constructions of bipartite graphs from finite geometries
• Minimal Regular Graphs of Girths Eight and Twelve
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: A note on the Turán function of even cycles