Sparse Kneser graphs are Hamiltonian-Reference-Cited by-同舟云学术

Sparse Kneser graphs are Hamiltonian

Published:2020-12-10 Issue:4 Volume:103 Page:1253-1275
ISSN:0024-6107
Container-title:Journal of the London Mathematical Society
language:en
Short-container-title:J. London Math. Soc.

Author:

Mütze Torsten¹,Nummenpalo Jerri²,Walczak Bartosz³

Affiliation:

1. Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom

2. Department of Computer Science ETH Zürich Universitätstrasse 6 Zurich CH‐8092 Switzerland

3. Department of Theoretical Computer Science Faculty of Mathematics and Computer Science Jagiellonian University ul. prof. S. Łojasiewicza 6 Kraków 30‐348 Poland

Funder

Grantová Agentura České Republiky

Deutsche Forschungsgemeinschaft

Narodowe Centrum Nauki

Publisher

Wiley

Subject

General Mathematics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1112/jlms.12406

Reference41 articles.

1. Chemical graphs. XIII. Combinatorial patterns;Balaban A. T.;Rev. Roumaine Math. Pures Appl.,1972

2. A short proof of Kneser's conjecture

3. J.BellmannandB.Schülke ‘Short proof that Kneser graphs are Hamiltonian forn⩾4k’ Preprint 2019 arXiv:1912.08186.

4. N.Biggs ‘Some odd graph theory’ Second International Conference on Combinatorial Mathematics Annals of the New York Academy of Sciences 39 (edsL. V.QuintasandA.Gewirtz;New York Academy of Sciences New York NY 1979)71–81.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Hamilton Compression of Highly Symmetric Graphs;Annals of Combinatorics;2023-12-13

2. Large cycles in generalized Johnson graphs;Journal of Graph Theory;2023-07-10

3. Kneser Graphs Are Hamiltonian;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Tight Dyck Words, Castling and Odd Graphs;2023

5. Kneser graphs are Hamiltonian;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023