Graphs without quadrilaterals
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3561377 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- On a problem of K. Zarankiewicz
- On Graphs that do not Contain a Thomsen Graph
- Polarities in finite projective planes
- Über ein Problem von K. Zarankiewicz
Cited in
(48)- The maximum spectral radius of C₄-free graphs of given order and size
- 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
- Union-free families of sets and equations over fields
- Exact solution of some Turán-type problems
- Polarities and \(2k\)-cycle-free graphs
- Triangle-free induced subgraphs of the unitary polarity graph
- Two-regular subgraphs of odd-uniform hypergraphs
- Multicolour Turán problems
- An extremal problem for cycles in hamiltonian graphs
- Some extremal results on 4-cycles
- The number of copies of \(K_{2,t+1}\) in a graph
- A spectral version of Mantel's theorem
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph
- Multicolored set multipartite Ramsey numbers
- New values for the bipartite Ramsey number of the four-cycle versus stars
- The number of 4-cycles in a graph
- General properties of some families of graphs defined by systems of equations
- Orthogonal polarity graphs and Sidon sets
- The price of stability of simple symmetric fractional hedonic games
- A note on the Turán function of even cycles
- All minimum \(C_{5}\)-saturated graphs
- Small cores in 3-uniform hypergraphs
- 4-cycles in mixing digraphs
- Color the cycles
- Excluding induced subgraphs: quadrilaterals
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- The largest minimum codegree of a 3-graph without a generalized 4-cycle
- Turán numbers of theta graphs
- ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- Decomposing graphs of high minimum degree into 4-cycles
- On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)
- Upper bounds on the extremal number of the 4‐cycle
- Four-vertex traces of finite sets
- Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
- Upper bounds on the multicolor Ramsey numbers \(r_k (C_4)\)
- Some exact results on 4-cycles: stability and supersaturation
- Turán number of complete bipartite graphs with bounded matching number
- Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs
- Turán number with bounded matching in \(K_{2,t}\)-free graph
- Extremal graphs without 4-cycles
- Hypergraphs in which all disjoint pairs have distinct unions
- Union-free hypergraphs and probability theory
- A new extremal property of Steiner triple-systems
- Ramsey numbers of \(C_4\) versus wheels and stars
- Eigenvalue bounds for independent sets
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
This page was built for publication: Graphs without quadrilaterals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835928)
