Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (Q2032752): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2021.112430 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2021.112430 / rank | |||
Normal rank | |||
Latest revision as of 20:05, 16 December 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
