For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set (Q6486798)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6370214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set |
scientific article; zbMATH DE number 6370214 |
Statements
For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set (English)
0 references
For most graphs <i>H</i> , most <i>H</i> -free graphs have a linear homogeneous set (English)
0 references
17 November 2014
0 references
Ramsey-type problems
0 references
finite graphs
0 references
\(r\)-partitions
0 references
hypergraphs
0 references
0 references
0.9111645817756652
0 references
0.8364391326904297
0 references
0.8252002000808716
0 references
0.819214403629303
0 references
0.815635621547699
0 references
