Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (Q4982284)
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 6418970
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal |
scientific article; zbMATH DE number 6418970 |
Statements
Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (English)
0 references
24 March 2015
0 references
universality
0 references
tournaments
0 references
cliques
0 references
anticliques
0 references
Erdős-Hajnal conjecture
0 references
0.8945397
0 references
0 references
0.84560066
0 references
0.83893096
0 references
0.83893085
0 references
0.8366556
0 references
