On the Holroyd-Talbot conjecture for sparse graphs (Q6056471)
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 7756991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Holroyd-Talbot conjecture for sparse graphs |
scientific article; zbMATH DE number 7756991 |
Statements
On the Holroyd-Talbot conjecture for sparse graphs (English)
0 references
30 October 2023
0 references
Holroyd-Talbot conjecture
0 references
Erdős-Ko-Rado theorem
0 references
intersecting family
0 references
0.8266290426254272
0 references
0.8206242918968201
0 references
0.7853035926818848
0 references
0.7803624868392944
0 references
0.7731703519821167
0 references
