Sparse Kneser graphs are Hamiltonian
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12696
- Type
- D - Journal article
- DOI
-
10.1112/jlms.12406
- Title of journal
- Journal of the London Mathematical Society
- Article number
- -
- First page
- 0
- Volume
- 0
- Issue
- -
- ISSN
- 0024-6107
- Open access status
- Compliant
- Month of publication
- December
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
T - Theory and Foundations
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This full version of a paper in STOC'18, one of the two top conferences in theoretical computer science, is published in a prestigious mathematics journal. STOC reviewer: "presents a breakthrough progress on a combinatorial conjecture that was open and studied for more than 40 years. The solution is also mathematically beautiful." Praised by several top researchers, including Füredi (University of Illinois and Rényi Institute): "Congratulations to your beautiful results." Pivotal in securing a €240k grant from the Czech Science Foundation and a €260k grant from the German Science Foundation, and formed a central piece of Nummenpalo's PhD thesis (ETHZ 2019).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -