Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592)
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: Embedding clique-factors in graphs with low \(\ell\)-independence number |
scientific article; zbMATH DE number 7681182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embedding clique-factors in graphs with low \(\ell\)-independence number |
scientific article; zbMATH DE number 7681182 |
Statements
Embedding clique-factors in graphs with low \(\ell\)-independence number (English)
0 references
2 May 2023
0 references
\(H\)-factor
0 references
regularity method
0 references
absorbing method
0 references
Ramsey-Turán problem
0 references
0 references
0.93713516
0 references
0.8936358
0 references
0.89324355
0 references
0.8803075
0 references
0.8780242
0 references
0.8780242
0 references
0.8725641
0 references
0.8706422
0 references
0.8700082
0 references
