Large cliques in \(C_4\)-free graphs

DOI10.1007/s004930200012zbMath0996.05094OpenAlexW1966724030MaRDI QIDQ700383

József Solymosi, Alice Hubenko, András Gyárfás

Publication date: 20 October 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930200012

zbMATH Keywords

cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Fractional Helly theorem for Cartesian products of convex sets ⋮ On arrangements of orthogonal circles ⋮ Graphs with no induced \(K_{2,t}\) ⋮ Efficient Testing without Efficient Regularity ⋮ Large cliques in hypergraphs with forbidden substructures ⋮ Induced Turán Numbers ⋮ Cliques in \(C_4\)-free graphs of large minimum degree ⋮ Radon numbers and the fractional Helly theorem

This page was built for publication: Large cliques in \(C_4\)-free graphs