\(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (Q1727770)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups |
scientific article |
Statements
\(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (English)
0 references
20 February 2019
0 references
Turan type problems
0 references
chromatic number
0 references
dense graphs
0 references
0 references
0 references
