On the density of subgraphs in a graph with bounded independence number (Q1272486): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:47, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the density of subgraphs in a graph with bounded independence number |
scientific article |
Statements
On the density of subgraphs in a graph with bounded independence number (English)
0 references
3 January 1999
0 references
The maximum density of the \(k\)-subgraphs of any \(n\)-graph with independence number at most \(m\) is determined up to a multiplicative constant for all \(n,m,k\).
0 references
density
0 references
independence number
0 references