{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:10Z","timestamp":1759639090031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_28","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"338-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On 1-Factorizations of Bipartite Kneser Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3720-5117","authenticated-orcid":false,"given":"Kai","family":"Jin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0024-3795(00)00123-3","volume":"318","author":"R Bapat","year":"2000","unstructured":"Bapat, R.: Moore-Penrose inverse of set inclusion matrices. Linear Algebra Appl. 318(1), 35\u201344 (2000)","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"28_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/jcd.3180020603","volume":"2","author":"J Bierbrauer","year":"1994","unstructured":"Bierbrauer, J., Edel, Y.: Theory of perpendicular arrays. J. Comb. Des. 2(6), 375\u2013406 (1994)","journal-title":"J. Comb. Des."},{"key":"28_CR3","volume-title":"CRC Handbook of Combinatorial Designs","year":"2007","unstructured":"Colbourn, C., Dinitz, J. (eds.): CRC Handbook of Combinatorial Designs, 2nd edn. CRC Press Inc., Boca Raton (2007)","edition":"2"},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/0097-3165(94)90030-2","volume":"65","author":"D Duffus","year":"1994","unstructured":"Duffus, D., Kierstead, H., Snevily, H.: An explicit 1-factorization in the middle of the Boolean lattice. J. Comb. Theory Ser. A 65(2), 334\u2013342 (1994)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"5","key":"28_CR5","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1016\/j.jcta.2007.09.002","volume":"115","author":"E Ghorbani","year":"2008","unstructured":"Ghorbani, E., Khosrovshahi, G., Maysoori, C., Mohammad-Noori, M.: Inclusion matrices and chains. J. Comb. Theory Ser. A 115(5), 878\u2013887 (2008)","journal-title":"J. Comb. Theory Ser. A"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Gregor, P., M\u00fctze, T., Nummenpalo, J.: A short proof of the middle levels theorem. CoRR abs\/1710.08249 (2018)","DOI":"10.19086\/da.3659"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"s1\u201310","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. s1\u201310(1), 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"key":"28_CR8","unstructured":"Jin, K., Jin, C., Gu, Z.: Cooperation via codes in restricted hat guessing games. In: International Conference on Autonomous Agents and Multiagent Systems (2019)"},{"key":"28_CR9","unstructured":"Jin, K.: On 1-factorizations of bipartite Kneser graphs. CoRR abs\/1704.08852 (2017)"},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF00337621","volume":"5","author":"H Kierstead","year":"1988","unstructured":"Kierstead, H., Trotter, W.: Explicit matchings in the middle levels of the Boolean lattice. Order 5(2), 163\u2013171 (1988)","journal-title":"Order"},{"key":"28_CR11","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley Longman Publishing Co., Inc., Boston (2005)"},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(91)90228-T","volume":"96","author":"E Kramer","year":"1991","unstructured":"Kramer, E., Wu, Q., Magliveras, S., Trung, T.: Some perpendicular arrays for arbitrarily large $$t$$. Discrete Math. 96(2), 101\u2013110 (1991)","journal-title":"Discrete Math."},{"issue":"4","key":"28_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1112\/plms\/pdw004","volume":"112","author":"T M\u00fctze","year":"2016","unstructured":"M\u00fctze, T.: Proof of the middle levels conjecture. Proc. Lond. Math. Soc. 112(4), 677 (2016)","journal-title":"Proc. Lond. Math. Soc."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"M\u00fctze, T., Nummenpalo, J.: A constant-time algorithm for middle levels Gray codes. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2238\u20132253. Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974782.147"},{"issue":"6","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1007\/s00493-016-3434-6","volume":"37","author":"T M\u00fctze","year":"2017","unstructured":"M\u00fctze, T., Su, P.: Bipartite Kneser graphs are Hamiltonian. Combinatorica 37(6), 1207\u20131219 (2017)","journal-title":"Combinatorica"},{"issue":"6","key":"28_CR16","doi-asserted-by":"publisher","first-page":"3892","DOI":"10.1109\/TIT.2012.2190380","volume":"58","author":"E Ordentlich","year":"2012","unstructured":"Ordentlich, E., Roth, R.: Low complexity two-dimensional weight-constrained codes. IEEE Trans. Inf. Theory 58(6), 3892\u20133899 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"28_CR17","first-page":"283","volume":"23","author":"C Rao","year":"1961","unstructured":"Rao, C.: Combinatorial arrangements analogous to orthogonal arrays. Sankhy\u0101 Indian J. Stat. Ser. A 23(3), 283\u2013286 (1961)","journal-title":"Sankhy\u0101 Indian J. Stat. Ser. A"},{"issue":"1","key":"28_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0195-6698(13)80058-3","volume":"11","author":"D Stinson","year":"1990","unstructured":"Stinson, D., Teirlinck, L.: A construction for authentication\/secrecy codes from 3-homogeneous permutation groups. Eur. J. Comb. 11(1), 73\u201379 (1990)","journal-title":"Eur. J. Comb."},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0024-3795(82)90027-1","volume":"46","author":"R Wilson","year":"1982","unstructured":"Wilson, R.: Incidence matrices of $$t$$-designs. Linear Algebra Appl. 46, 73\u201382 (1982)","journal-title":"Linear Algebra Appl."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:06:54Z","timestamp":1709820414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}