Local Density in Graphs with Forbidden Subgraphs

DOI10.1017/S0963548302005539zbMath1029.05079OpenAlexW2150193181WikidataQ56267164 ScholiaQ56267164MaRDI QIDQ4802165

Peter Keevash, Benjamin Sudakov

Publication date: 24 September 2003

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548302005539

zbMATH Keywords

local densityTurán graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Intersections of graphs ⋮ Intersections of hypergraphs ⋮ Edge density of new graph types based on a random digraph family ⋮ Making a \(K_4\)-free graph bipartite ⋮ Sparse halves in triangle-free graphs