Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (Q4982284): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:30, 8 February 2024
scientific article; zbMATH DE number 6418970
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
