Abstract: We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.
Recommendations
- Some extremal results on 4-cycles
- Upper bounds on the extremal number of the 4‐cycle
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
- On the number of edges of quadrilateral-free graphs
- Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle
Cites work
- scientific article; zbMATH DE number 89768 (Why is no real title available?)
- scientific article; zbMATH DE number 1943958 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
- Graphs without four-cycles
- Graphs without quadrilaterals
- On the number of edges of quadrilateral-free graphs
- Polarities in finite projective planes
- Über ein Problem von K. Zarankiewicz
Cited in
(18)- ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE
- Some extremal results on 4-cycles
- The Turán number of directed paths and oriented cycles
- On 4-connected graphs without even cycle decompositions
- scientific article; zbMATH DE number 89768 (Why is no real title available?)
- Extremal digraphs avoiding an orientation of \(C_4\)
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
- Ramsey numbers of \(C_4\) versus wheels and stars
- On graphs and algebraic graphs that do not contain cycles of length 4
- scientific article; zbMATH DE number 2145243 (Why is no real title available?)
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
- Orthogonal polarity graphs and Sidon sets
- Turán numbers of theta graphs
- Extremal graphs of order dimension 4
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- Upper bounds on the extremal number of the 4‐cycle
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
- Upper bounds on the multicolor Ramsey numbers \(r_k (C_4)\)
This page was built for publication: Extremal graphs without 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744158)
