Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (Q2032752): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:57, 1 February 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
