Near-perfect clique-factors in sparse pseudorandom graphs (Q5886099)
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 7670415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-perfect clique-factors in sparse pseudorandom graphs |
scientific article; zbMATH DE number 7670415 |
Statements
Near-perfect clique-factors in sparse pseudorandom graphs (English)
0 references
30 March 2023
0 references
linear programming
0 references
probabilistic techniques
0 references
0.9805039763450624
0 references
0.9321202635765076
0 references
0.8489962816238403
0 references
0.8140972256660461
0 references
0.8072803020477295
0 references
