On the density of subgraphs in a graph with bounded independence number

DOI10.1006/jctb.1998.1818zbMath0916.05039OpenAlexW2085943590MaRDI QIDQ1272486

Pavel Valtr

Publication date: 3 January 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b2bfff2d8943b3fdd36ffcac0e72333bf4c8571c

zbMATH Keywords

densityindependence number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound for some ramsey numbers
• Independence numbers of locally sparse graphs and a Ramsey type problem
• On the theory of graphs