Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (Q2032752): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114190618, #quickstatements; #temporary_batch_1706897434465 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:38, 5 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
