Small universal families for graphs omitting cliques without GCH (Q711564)
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 5806724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Small universal families for graphs omitting cliques without GCH |
scientific article; zbMATH DE number 5806724 |
Statements
Small universal families for graphs omitting cliques without GCH (English)
0 references
27 October 2010
0 references
triangle-free graphs
0 references
graphs omitting cliques
0 references
universal models
0 references
infinite combinatorics
0 references
0.8709676861763
0 references
0.8608208298683167
0 references
0.8435683250427246
0 references
0.8435683250427246
0 references
0.828787088394165
0 references
