Local Density in Graphs with Forbidden Subgraphs

DOI10.1017/S0963548302005539MaRDI QIDQ4802165zbMATH OpenOpenAlexWikidataFDO

Authors Peter Keevash, Benny 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)

Recommendations

• Stability for large forbidden subgraphs
• The number of graphs without forbidden subgraphs
• The clique density theorem
• On graphs with small subgraphs of large chromatic number

Cited in

(11)

• Locally sparse graph with large density
• Intersections of graphs
• Sparse halves in triangle-free graphs
• Making a K₄-free graph bipartite
• The local density of triangle-free graphs
• Forbidden subgraphs and weak locally connected graphs
• 10 problems for partitions of triangle-free graphs
• Intersections of hypergraphs
• Locally common graphs
• Edge density of new graph types based on a random digraph family
• Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture

This page was built for publication: Local Density in Graphs with Forbidden Subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4802165)