Maximal independent sets in clique-free graphs (Q2674559)
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 7584360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal independent sets in clique-free graphs |
scientific article; zbMATH DE number 7584360 |
Statements
Maximal independent sets in clique-free graphs (English)
0 references
14 September 2022
0 references
Ruzsa-Szemerédi problem
0 references
rainbow Turán problems for cliques
0 references
0 references
0.94344693
0 references
0.9433373
0 references
0.94197375
0 references
0.9418085
0 references
0.94036585
0 references
0.93962926
0 references
0.9387218
0 references
0.9377296
0 references
