Graphs without quadrilaterals
From MaRDI portal
Publication:1835928
DOI10.1016/0095-8956(83)90018-7zbMath0505.05038OpenAlexW2003132645MaRDI QIDQ1835928
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90018-7
Related Items
Multicolour Turán problems ⋮ Excluding induced subgraphs: quadrilaterals ⋮ Multicolored set multipartite Ramsey numbers ⋮ Triangle-free induced subgraphs of the unitary polarity graph ⋮ An extremal problem for cycles in hamiltonian graphs ⋮ ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE ⋮ Small cores in 3-uniform hypergraphs ⋮ Exact solution of some Turán-type problems ⋮ The number of copies of \(K_{2,t+1}\) in a graph ⋮ New values for the bipartite Ramsey number of the four-cycle versus stars ⋮ Color the cycles ⋮ The number of 4-cycles in a graph ⋮ Two-regular subgraphs of odd-uniform hypergraphs ⋮ Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ 4-cycles in mixing digraphs ⋮ Upper bounds on the extremal number of the 4‐cycle ⋮ On super 2-restricted and 3-restricted edge-connected vertex transitive graphs ⋮ Ramsey numbers of \(C_4\) versus wheels and stars ⋮ Four-vertex traces of finite sets ⋮ Eigenvalue bounds for independent sets ⋮ All minimum C5-saturated graphs ⋮ A spectral version of Mantel's theorem ⋮ The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle ⋮ 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 ⋮ Orthogonal Polarity Graphs and Sidon Sets ⋮ Extremal graphs without 4-cycles ⋮ The Price of Stability of Simple Symmetric Fractional Hedonic Games ⋮ The maximum spectral radius of \(C_4\)-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 ⋮ Hypergraphs in which all disjoint pairs have distinct unions ⋮ Turán numbers of theta graphs ⋮ Polarities and \(2k\)-cycle-free graphs ⋮ A note on the Turán function of even cycles ⋮ Union-free hypergraphs and probability theory ⋮ On the chromatic number of the Erdős-Rényi orthogonal polarity graph ⋮ A new extremal property of Steiner triple-systems ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles ⋮ Union-free families of sets and equations over fields
Cites Work
This page was built for publication: Graphs without quadrilaterals
