Graphs without four-cycles

DOI10.1002/JGT.3190130107zbMath0679.05043OpenAlexW2040040623MaRDI QIDQ3835487

A. Flockhart, C. R. J. Clapham, John Sheehan

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130107

zbMATH Keywords

extremal graphsforbidden 4-cyclemaximum number of edges in a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (29)

On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\) ⋮ On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\) ⋮ An extremal problem for cycles in hamiltonian graphs ⋮ ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE ⋮ Bounds on the Steiner–Wiener index of graphs ⋮ Ramsey numbers of \(C_4\) versus wheels and stars ⋮ A note on 3‐partite graphs without 4‐cycles ⋮ The Turán number of directed paths and oriented cycles ⋮ Subdividing a graph toward a unit-distance graph in the plane ⋮ New classes of extremal graphs with given bandwidth ⋮ Planar Ramsey numbers for cycles ⋮ Maximum cardinality neighbourly sets in quadrilateral free graphs ⋮ An Almost Strongly Minimal Non-Desarguesian Projective Plane ⋮ Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size ⋮ On some Ramsey numbers for quadrilaterals versus wheels ⋮ Some Projective Planes of Lenz-Barlotti Class I ⋮ New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\) ⋮ Restricted size Ramsey number for P3 versus cycle ⋮ Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\) ⋮ Orthogonal Polarity Graphs and Sidon Sets ⋮ Extremal graphs without 4-cycles ⋮ The maximum size of hypergraphs without generalized 4-cycles ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ Polarities and \(2k\)-cycle-free graphs ⋮ There are many almost strongly minimal generalized n-gons that do not interpret an infinite group ⋮ A note on the Turán function of even cycles ⋮ A new notion of vertex independence and rank for finite graphs ⋮ Wheel and star-critical Ramsey numbers for quadrilateral ⋮ Optimal monomial quadratization for ODE systems

Cites Work

• Unnamed Item
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: Graphs without four-cycles