On the number of edges of quadrilateral-free graphs
From MaRDI portal
Publication:1924153
DOI10.1006/jctb.1996.0052zbMath0858.05063OpenAlexW2016480989MaRDI QIDQ1924153
Publication date: 23 March 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0052
Related Items (45)
Multicolour Turán problems ⋮ On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\) ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Triangle-free induced subgraphs of the unitary polarity graph ⋮ The independence number for polarity graphs of even order planes ⋮ New values for the bipartite Ramsey number of the four-cycle versus stars ⋮ Grid obstacle representation of graphs ⋮ Forbidding multiple copies of forestable graphs ⋮ The number of 4-cycles in a graph ⋮ Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ Upper bounds on the extremal number of the 4‐cycle ⋮ Ramsey numbers of \(C_4\) versus wheels and stars ⋮ Four-vertex traces of finite sets ⋮ A note on 3‐partite graphs without 4‐cycles ⋮ Kernelization for cycle transversal problems ⋮ Extremal results for \(C_3^-\)-free signed graphs ⋮ Unnamed Item ⋮ On \(3\)-uniform hypergraphs avoiding a cycle of length four ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ Eigenvalue bounds for independent sets ⋮ All minimum C5-saturated graphs ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ New classes of extremal graphs with given bandwidth ⋮ A spectral version of Mantel's theorem ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ Maximum cardinality neighbourly sets in quadrilateral free graphs ⋮ General properties of some families of graphs defined by systems of equations ⋮ On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) ⋮ Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size ⋮ Some extremal results on 4-cycles ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Orthogonal Polarity Graphs and Sidon Sets ⋮ Extremal graphs without 4-cycles ⋮ Minimum C5‐saturated graphs ⋮ On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs ⋮ The maximum size of hypergraphs without generalized 4-cycles ⋮ Extremal problems for sets forming Boolean algebras and complete partite hypergraphs ⋮ Turán numbers of theta graphs ⋮ A note on the Turán function of even cycles ⋮ \(C_{3}\) saturated graphs ⋮ Spectral extrema of graphs: forbidden hexagon ⋮ Cops and Robbers on Graphs Based on Designs ⋮ On the chromatic number of the Erdős-Rényi orthogonal polarity graph ⋮ Wheel and star-critical Ramsey numbers for quadrilateral ⋮ Optimal monomial quadratization for ODE systems
This page was built for publication: On the number of edges of quadrilateral-free graphs
