Graphs without four-cycles

DOI10.1002/JGT.3190130107MaRDI QIDQ3835487zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• On Graphs that do not Contain a Thomsen Graph

Cited in

(43)

• Upper bounds on the extremal number of the 4‐cycle
• On 4-connected graphs without even cycle decompositions
• 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})\)
• Optimal monomial quadratization for ODE systems
• scientific article; zbMATH DE number 1744069 (Why is no real title available?)
• Graphs omitting a finite set of cycles
• A note on 3‐partite graphs without 4‐cycles
• On some Ramsey numbers for quadrilaterals versus wheels
• scientific article; zbMATH DE number 2145243 (Why is no real title available?)
• 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
• Graphs without theta subgraphs
• A new notion of vertex independence and rank for finite graphs
• Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
• Extremal graphs without four-cycles or five-cycles
• scientific article; zbMATH DE number 57426 (Why is no real title available?)
• Graphs without dead ends
• Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
• Restricted size Ramsey number for \(P_3\) versus cycle
• New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
• 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
• Ramsey numbers of \(C_4\) versus wheels and stars
• Planar Ramsey numbers for cycles
• Bounds on the Steiner-Wiener index of graphs
• 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
• scientific article; zbMATH DE number 89768 (Why is no real title available?)
• 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
• Maximum cardinality neighbourly sets in quadrilateral free graphs
• ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE
• Orthogonal polarity graphs and Sidon sets
• Extremal graphs without 4-cycles
• Some Projective Planes of Lenz-Barlotti Class I

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)