Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (Q2032752): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2021.112430 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3157121578 / rank | |||
Normal rank | |||
Revision as of 19:11, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) |
scientific article |
Statements
Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (English)
0 references
14 June 2021
0 references
Kneser graph
0 references
Hamiltonian cycle
0 references
