On the maximum density of graphs which have no subcontraction to \(K^ r\). (Q1053033): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3852212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hadwiger's conjecture is true for almost every graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Homomorphiesätze für Graphen / rank | |||
Normal rank | |||
Latest revision as of 08:48, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the maximum density of graphs which have no subcontraction to \(K^ r\). |
scientific article |
Statements
On the maximum density of graphs which have no subcontraction to \(K^ r\). (English)
0 references
1983
0 references
density
0 references
subcontraction
0 references
Hadwiger number
0 references
