Extremal graphs without 4-cycles

DOI10.1016/j.jctb.2013.01.001zbMath1301.05186arXiv1201.4912OpenAlexW2005344823MaRDI QIDQ744158

Peter M. Kosek, Frank A. Firke, Evan D. Nash, Jason S. Williford

Publication date: 6 October 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.4912

zbMATH Keywords

\(C_4\)-free graphupper bound for the number of edges

Mathematics Subject Classification ID

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

Related Items

ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE, Upper bounds on the extremal number of the 4‐cycle, Ramsey numbers of \(C_4\) versus wheels and stars, The Turán number of directed paths and oriented cycles, Maximum cardinality neighbourly sets in quadrilateral free graphs, A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints, Some extremal results on 4-cycles, Orthogonal Polarity Graphs and Sidon Sets, Extremal digraphs avoiding an orientation of \(C_4\), Turán numbers of theta graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
• Graphs without quadrilaterals
• On the number of edges of quadrilateral-free graphs
• Über ein Problem von K. Zarankiewicz
• Graphs without four-cycles
• Polarities in finite projective planes