Near-perfect clique-factors in sparse pseudorandom graphs (Q1792104)
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 6952012
| 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 6952012 |
Statements
Near-perfect clique-factors in sparse pseudorandom graphs (English)
0 references
11 October 2018
0 references
clique-factors
0 references
\((n,d, \lambda)\)-graphs
0 references
pseudorandomness
0 references
0.9805039763450624
0 references
0.9372008442878724
0 references
0.8714084029197693
0 references
0.8377428650856018
0 references
0.81037437915802
0 references
