For most graphs <i>H</i> , most <i>H</i> -free graphs have a linear homogeneous set (Q2930050)
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: For most graphs H , most H -free graphs have a linear homogeneous set |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | For most graphs <i>H</i> , most <i>H</i> -free graphs have a linear homogeneous set |
scientific article |
Statements
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
