On the density of subgraphs in a graph with bounded independence number (Q1272486): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2085943590 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Independence numbers of locally sparse graphs and a Ramsey type problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3682518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3866151 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871773 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3825110 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound for some ramsey numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the theory of graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:43, 28 May 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