Graphs without four-cycles

DOI10.1002/JGT.3190130107zbMATH Open0679.05043OpenAlexW2040040623MaRDI QIDQ3835487FDOQ3835487

Authors: C. R. J. Clapham, A. Flockhart, J. 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

Recommendations

• scientific article; zbMATH DE number 89768
• Extremal graphs without three‐cycles or four‐cycles
• On the number of edges of quadrilateral-free graphs
• Upper bounds on the extremal number of the 4‐cycle
• Extremal graphs without cycles of length 8 or less

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)

Cites Work

• Title not available (Why is that?)
• On Graphs that do not Contain a Thomsen Graph

Cited In (43)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835487)