{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:49Z","timestamp":1759638649552},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,10,24]],"date-time":"2016-10-24T00:00:00Z","timestamp":1477267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00493-016-3434-6","type":"journal-article","created":{"date-parts":[[2016,10,24]],"date-time":"2016-10-24T05:44:32Z","timestamp":1477287872000},"page":"1207-1219","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Bipartite Kneser Graphs are Hamiltonian"],"prefix":"10.1007","volume":"37","author":[{"given":"Torsten","family":"M\u00fctze","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Su","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"key":"3434_CR1","volume-title":"Second International Conference on Combinatorial Mathematics (New York, 1978)","author":"N. Biggs","year":"1979","unstructured":"N. Biggs: Some odd graph theory, in: Second International Conference on Combinatorial Mathematics (New York, 1978), volume 319 of Ann. New York Acad. Sci., 71-81, New York Acad. Sci., New York, 1979."},{"key":"3434_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(84)90179-1","volume":"48","author":"M. Buck","year":"1984","unstructured":"M. Buck and D. Wiedemann: Gray codes with restricted density, Discrete Math.\n                           48 (1984), 163-171.","journal-title":"Discrete Math."},{"key":"3434_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s004930200007","volume":"22","author":"Y. Chen","year":"2002","unstructured":"Y. Chen and Z. F\u00fcredi: Hamiltonian Kneser graphs, Combinatorica\n                           22 (2002), 147-149.","journal-title":"Combinatorica"},{"key":"3434_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jctb.2000.1969","volume":"80","author":"Y. Chen","year":"2000","unstructured":"Y. Chen: Kneser graphs are Hamiltonian for n=3k, J. Combin. Theory Ser. B\n                           80 (2000), 69-79.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3434_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0095-8956(03)00040-6","volume":"89","author":"Y. Chen","year":"2003","unstructured":"Y. Chen: Triangle-free Hamiltonian Kneser graphs, J. Combin. Theory Ser. B\n                           89 (2003), 1-16.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3434_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0095-8956(87)90044-X","volume":"42","author":"B. Chen","year":"1987","unstructured":"B. Chen and K. Lih: Hamiltonian uniform subset graphs, J. Combin. Theory Ser. B\n                           42 (1987), 257-263.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3434_CR7","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/0097-3165(94)90030-2","volume":"65","author":"D. Duffus","year":"1994","unstructured":"D. Duffus, H. Kierstead and H. Snevily: An explicit 1-factorization in the middle of the Boolean lattice, J. Combin. Theory Ser. A\n                           65 (1994), 334-342.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3434_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00337620","volume":"5","author":"D. Duffus","year":"1988","unstructured":"D. Duffus, B. Sands and R. Woodrow: Lexicographic matchings cannot form Hamiltonian cycles, Order\n                           5 (1988), 149-161.","journal-title":"Order"},{"key":"3434_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(94)00283-O","volume":"144","author":"S. Felsner","year":"1995","unstructured":"S. Felsner and W. Trotter: Colorings of diagrams of interval orders and ff-sequences of sets, Discrete Math.\n                           144 (1995), 23-31. Combinatorics of ordered sets (Oberwolfach, 1991).","journal-title":"Discrete Math."},{"key":"3434_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/jgt.3190150204","volume":"15","author":"R. Gould","year":"1991","unstructured":"R. Gould: Updating the hamiltonian problem-a survey, Journal of Graph Theory\n                           15 (1991), 121-157.","journal-title":"Journal of Graph Theory"},{"key":"3434_CR11","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1016\/j.ins.2010.02.009","volume":"180","author":"P. Gregor","year":"2010","unstructured":"P. Gregor and R. Skrekovski: On generalized middle-level problem, Inform. Sci.\n                           180 (2010), 2448-2457.","journal-title":"Inform. Sci."},{"key":"3434_CR12","volume-title":"Graphs and other combinatorial topics (Prague, 1982)","author":"I. Havel","year":"1983","unstructured":"I. Havel: Semipaths in directed cubes, in: Graphs and other combinatorial topics (Prague, 1982), volume 59 of Teubner-Texte Math., 101-108. Teubner, Leipzig, 1983."},{"key":"3434_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0898-1221(88)90213-1","volume":"15","author":"F. Harary","year":"1988","unstructured":"F. Harary, J. Hayes and H. Wu: A survey of the theory of hypercube graphs, Comput. Math. Appl.\n                           15 (1988), 277-289.","journal-title":"Comput. Math. Appl."},{"key":"3434_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s11083-005-9008-7","volume":"22","author":"P. Hor\u00e1k","year":"2005","unstructured":"P. Hor\u00e1k, T. Kaiser, M. Rosenfeld and Z. Ryj\u00e1cek: The prism over the middlelevels graph is Hamiltonian, Order\n                           22 (2005), 73-81.","journal-title":"Order"},{"key":"3434_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(94)90115-5","volume":"128","author":"G. Hurlbert","year":"1994","unstructured":"G. Hurlbert: The antipodal layers problem, Discrete Math.\n                           128 (1994), 237-245.","journal-title":"Discrete Math."},{"key":"3434_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1017\/S1446788700011563","volume":"26","author":"K. Heinrich","year":"1978","unstructured":"K. Heinrich and W. Wallis: Hamiltonian cycles in certain graphs, J. Austral. Math. Soc. Ser. A\n                           26 (1978), 89-98.","journal-title":"J. Austral. Math. Soc. Ser. A"},{"key":"3434_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jcta.2003.11.004","volume":"105","author":"R. Johnson","year":"2004","unstructured":"R. Johnson: Long cycles in the middle two layers of the discrete cube, J. Combin. Theory Ser. A\n                           105 (2004), 255-271.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3434_CR18","unstructured":"R. Johnson: An inductive construction for Hamilton cycles in Kneser graphs, Electron. J. Combin.\n                           18 (2011), Paper 189, 12."},{"key":"3434_CR19","volume-title":"Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972)","author":"R. Karp","year":"1972","unstructured":"R. Karp: Reducibility among combinatorial problems, in: Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), 85-103, New York, 1972. Plenum."},{"key":"3434_CR20","unstructured":"D. K\u00fchn and D. Osthus: Hamilton cycles in graphs and hypergraphs: an extremal perspective, To appear in Proceedings of the ICM 2014."},{"key":"3434_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF00337621","volume":"5","author":"H. Kierstead","year":"1988","unstructured":"H. Kierstead and W. Trotter: Explicit matchings in the middle levels of the Boolean lattice, Order\n                           5 (1988), 163-171.","journal-title":"Order"},{"key":"3434_CR22","volume-title":"Proc. Calgary Internat. Conf. (Calgary, Alberta, 1969)","author":"L. Lov\u00e1sz","year":"1970","unstructured":"L. Lov\u00e1sz: Problem 11, in Combinatorial structures and their applications, in: Proc. Calgary Internat. Conf. (Calgary, Alberta, 1969), xvi+508, New York, 1970. Gordon and Breach Science Publishers."},{"key":"3434_CR23","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L. Lov\u00e1sz","year":"1978","unstructured":"L. Lov\u00e1sz: Kneser\u2019s conjecture, chromatic number, and homotopy, J. Combin. Theory Ser. A\n                           25 (1978), 319-324.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3434_CR24","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0095-8956(76)90066-6","volume":"20","author":"M. Mather","year":"1976","unstructured":"M. Mather: The Rugby footballers of Croam, J. Combinatorial Theory Ser. B\n                           20 (1976), 62-63.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"3434_CR25","volume-title":"Combinatorics (Proc. Conf. Combinatorial Math., Math. Inst., Oxford, 1972)","author":"G. Meredith","year":"1972","unstructured":"G. Meredith and K. Lloyd: The Hamiltonian graphs O4 to O7, in: Combinatorics (Proc. Conf. Combinatorial Math., Math. Inst., Oxford, 1972), 229-236. Inst. Math. Appl., Southend-on-Sea, 1972."},{"key":"3434_CR26","unstructured":"T. M\u00fctze: Proof of the middle levels conjecture, accepted for publication by the Proceedings of the London Mathematical Society."},{"key":"3434_CR27","volume-title":"arXiv:0912.4564","author":"M. Shimada","year":"2011","unstructured":"M. Shimada and K. Amano: A note on the middle levels conjecture, arXiv:0912.4564, September 2011."},{"key":"3434_CR28","first-page":"97","volume":"35-A","author":"C. Savage","year":"1993","unstructured":"C. Savage: Long cycles in the middle two levels of the boolean lattice, Ars Combin.\n                           35-A (1993), 97-108.","journal-title":"Ars Combin."},{"key":"3434_CR29","doi-asserted-by":"crossref","unstructured":"C. Savage: A survey of combinatorial Gray codes, SIAM Rev. 39 (1997), 605-629.","DOI":"10.1137\/S0036144595295272"},{"key":"3434_CR30","first-page":"97","volume":"85","author":"J. Simpson","year":"1991","unstructured":"J. Simpson: Hamiltonian bipartite graphs, in: Proceedings of the Twenty-second Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1991), volume 85, 97-110, 1991.","journal-title":"Proceedings of the Twenty-second Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1991)"},{"key":"3434_CR31","first-page":"309","volume":"37","author":"J. Simpson","year":"1994","unstructured":"J. Simpson: On uniform subset graphs, Ars Combin.\n                           37 (1994), 309-318.","journal-title":"Ars Combin."},{"key":"3434_CR32","first-page":"13","volume":"40","author":"I. Shields","year":"2004","unstructured":"I. Shields and C. Savage: A note on Hamilton cycles in Kneser graphs, Bull. Inst. Combin. Appl.\n                           40 (2004), 13-22.","journal-title":"Bull. Inst. Combin. Appl."},{"key":"3434_CR33","doi-asserted-by":"publisher","first-page":"5271","DOI":"10.1016\/j.disc.2007.11.010","volume":"309","author":"I. Shields","year":"2009","unstructured":"I. Shields, B. Shields and C. Savage: An update on the middle levels problem, Discrete Math.\n                           309 (2009), 5271-5277.","journal-title":"Discrete Math."},{"key":"3434_CR34","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0097-3165(95)90091-8","volume":"70","author":"C. Savage","year":"1995","unstructured":"C. Savage and P. Winkler: Monotone Gray codes and the middle levels problem, J. Combin. Theory Ser. A\n                           70 (1995), 230-248.","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3434-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3434-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3434-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T11:04:15Z","timestamp":1544785455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3434-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["3434"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3434-6","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,24]]}}}