Triangle factors in sparse pseudo-random graphs (Q558243)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Triangle factors in sparse pseudo-random graphs |
scientific article; zbMATH DE number 2186325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triangle factors in sparse pseudo-random graphs |
scientific article; zbMATH DE number 2186325 |
Statements
Triangle factors in sparse pseudo-random graphs (English)
0 references
5 July 2005
0 references
The goal of this paper is to obtain results towards a blow-up lemma type embedding statement for pseudo-random graphs with small (sublinear) degrees. Along this line of investigations results on the existence of triangle factors in terms of the second eigenvalue in \(d\)-regular graphs are given. Similar results for fractional triangle factors are also obtained. The tightness is shown by construction.
0 references
0.8602896928787231
0 references
0.8510923981666565
0 references
0.81037437915802
0 references
0.8072803020477295
0 references
0.7948276996612549
0 references
