{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:22:56Z","timestamp":1783984976399,"version":"3.55.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T00:00:00Z","timestamp":1735776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T00:00:00Z","timestamp":1735776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00493-024-00128-w","type":"journal-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T01:04:09Z","timestamp":1735866249000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Number of Colorings of the Middle Layers of the Hamming Cube"],"prefix":"10.1007","volume":"45","author":[{"given":"Lina","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gweneth","family":"McKinley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinyoung","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,2]]},"reference":[{"key":"128_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.jcta.2015.01.003","volume":"132","author":"J Balogh","year":"2015","unstructured":"Balogh, J., Das, S., Delcourt, M., Liu, H., Sharifzadeh, M.: Intersecting families of discrete structures are typically trivial. J. Comb. Theory Ser. A 132, 224\u2013245 (2015)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"128_CR2","first-page":"P2","volume":"26","author":"J Balogh","year":"2019","unstructured":"Balogh, J., Liu, H., Sharifzadeh, M., Das, S., Tran, T.: Structure and supersaturation for intersecting families. Electron. J. Comb. 26(2), P2-34 (2019)","journal-title":"Electron. J. Comb."},{"key":"128_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2020.105341","volume":"178","author":"J Balogh","year":"2021","unstructured":"Balogh, J., Garcia, R.I., Li, L.: Independent sets in the middle two layers of Boolean lattice. J. Comb. Theory Ser. A 178, 105341 (2021)","journal-title":"J. Comb. Theory Ser. A"},{"key":"128_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.jctb.2023.09.002","volume":"164","author":"J Balogh","year":"2024","unstructured":"Balogh, J., Garcia, R.I., Li, L., Wagner, A.Z.: Intersecting families of sets are typically trivial. J. Comb. Theory Ser. B 164, 44\u201367 (2024)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"128_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0097-3165(86)90019-1","volume":"43","author":"FRK Chung","year":"1986","unstructured":"Chung, F.R.K., Graham, R.L., Frankl, P., Shearer, J.B.: Some intersection theorems for ordered sets and graphs. J. Comb. Theory Ser. A 43(1), 23\u201337 (1986)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"128_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2010.08.004","volume":"32","author":"D Duffus","year":"2011","unstructured":"Duffus, D., Frankl, P., R\u00f6dl, V.: Maximal independent sets in bipartite graphs obtained from Boolean lattices. Eur. J. Comb. 32(1), 1\u20139 (2011)","journal-title":"Eur. J. Comb."},{"issue":"5","key":"128_CR7","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1016\/j.jctb.2012.05.003","volume":"102","author":"J Engbers","year":"2012","unstructured":"Engbers, J., Galvin, D.: H-coloring tori. J. Comb. Theory Ser. B 102(5), 1110\u20131133 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"128_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s00220-007-0279-2","volume":"274","author":"R Fern\u00e1ndez","year":"2007","unstructured":"Fern\u00e1ndez, R., Procacci, A.: Cluster expansion for abstract polymer models. new bounds from an old approach. Commun. Math. Phys. 274(1), 123\u2013140 (2007)","journal-title":"Commun. Math. Phys."},{"issue":"1","key":"128_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1017\/S0963548317000529","volume":"27","author":"P Frankl","year":"2018","unstructured":"Frankl, P., Kupavskii, A.: Counting intersecting and pairs of cross-intersecting families. Comb. Probab. Comput. 27(1), 60\u201368 (2018)","journal-title":"Comb. Probab. Comput."},{"key":"128_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/9781316882603","volume-title":"Statistical Mechanics of Lattice Systems: A Concrete Mathematical Introduction","author":"S Friedli","year":"2017","unstructured":"Friedli, S., Velenik, Y.: Statistical Mechanics of Lattice Systems: A Concrete Mathematical Introduction. Cambridge University Press, Cambridge (2017)"},{"key":"128_CR11","doi-asserted-by":"crossref","unstructured":"Galanis, A., Goldberg, L., Jerrum, M.: Approximately counting H-colorings is #BIS-hard. In: Lecture Notes in Comput. Sci., vol. 9134. Springer, Berlin (2015)","DOI":"10.1007\/978-3-662-47672-7_43"},{"key":"128_CR12","unstructured":"Galvin, D.: Independent sets in the discrete hypercube. arXiv preprint arXiv:1901.01991 (2019)"},{"issue":"1","key":"128_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02783426","volume":"138","author":"D Galvin","year":"2003","unstructured":"Galvin, D.: On homomorphisms from the Hamming cube to Z. Isr. J. Math. 138(1), 189\u2013213 (2003)","journal-title":"Isr. J. Math."},{"issue":"2","key":"128_CR14","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11083-012-9253-5","volume":"30","author":"L Ilinca","year":"2013","unstructured":"Ilinca, L., Kahn, J.: Counting maximal antichains and independent sets. Order 30(2), 427\u2013435 (2013)","journal-title":"Order"},{"key":"128_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2023.109212","volume":"430","author":"M Jenssen","year":"2023","unstructured":"Jenssen, M., Keevash, P.: Homomorphisms from the torus. Adv. Math. 430, 109212 (2023)","journal-title":"Adv. Math."},{"issue":"2","key":"128_CR16","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1112\/jlms.12331","volume":"102","author":"M Jenssen","year":"2020","unstructured":"Jenssen, M., Perkins, W.: Independent sets in the hypercube revisited. J. Lond. Math. Soc. 102(2), 645\u2013669 (2020)","journal-title":"J. Lond. Math. Soc."},{"issue":"4","key":"128_CR17","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1137\/19M1286669","volume":"49","author":"M Jenssen","year":"2020","unstructured":"Jenssen, M., Keevash, P., Perkins, W.: Algorithms for #BIS-hard problems on expander graphs. SIAM J. Comput. 49(4), 681\u2013710 (2020)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"128_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02772616","volume":"124","author":"J Kahn","year":"2001","unstructured":"Kahn, J.: Range of cube-indexed random walk. Isr. J. Math. 124(1), 189\u2013201 (2001)","journal-title":"Isr. J. Math."},{"issue":"2","key":"128_CR19","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s11856-020-1984-1","volume":"236","author":"J Kahn","year":"2020","unstructured":"Kahn, J., Park, J.: The number of 4-colorings of the Hamming cube. Isr. J. Math. 236(2), 629\u2013649 (2020)","journal-title":"Isr. J. Math."},{"key":"128_CR20","doi-asserted-by":"crossref","unstructured":"Kahn, J., Park, J.: The number of maximal independent sets in the Hamming cube. Combinatorica, 1\u201328 (2022)","DOI":"10.1007\/s00493-021-4729-9"},{"key":"128_CR21","doi-asserted-by":"crossref","unstructured":"Katona, G.: A theorem of finite sets. In: Classic Papers in Combinatorics, pp. 381\u2013401. Springer, Berlin (2009)","DOI":"10.1007\/978-0-8176-4842-8_27"},{"key":"128_CR22","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 1, Fascicle 1: MMIX\u2014A RISC Computer for the New Millennium. Addison-Wesley Professional (2005)"},{"issue":"3","key":"128_CR23","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/BF01211762","volume":"103","author":"R Koteck\u1ef3","year":"1986","unstructured":"Koteck\u1ef3, R., Preiss, D.: Cluster expansion for abstract polymer models. Commun. Math. Phys. 103(3), 491\u2013498 (1986)","journal-title":"Commun. Math. Phys."},{"key":"128_CR24","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1525\/9780520319875-014","volume":"10","author":"JB Kruskal","year":"1963","unstructured":"Kruskal, J.B.: The number of simplices in a complex. Math. Optim. Techniques 10, 251\u2013278 (1963)","journal-title":"Math. Optim. Techniques"},{"issue":"4","key":"128_CR25","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discret. Math. 13(4), 383\u2013390 (1975)","journal-title":"Discret. Math."},{"key":"128_CR26","volume-title":"Combinatorial Problems and Exercises","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)"},{"key":"128_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819896","volume-title":"The Theory of Information and Coding","author":"RJ McEliece","year":"2004","unstructured":"McEliece, R.J.: The Theory of Information and Coding, vol. 86. Cambridge University Press, Cambridge (2004)"},{"issue":"4","key":"128_CR28","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1017\/S0963548313000163","volume":"22","author":"R Peled","year":"2013","unstructured":"Peled, R., Samotij, W., Yehudayoff, A.: Lipschitz functions on expanders are typically flat. Comb. Probab. Comput. 22(4), 566\u2013591 (2013)","journal-title":"Comb. Probab. Comput."},{"key":"128_CR29","first-page":"42","volume":"45","author":"AA Sapozhenko","year":"1987","unstructured":"Sapozhenko, A.A.: On the number of connected subsets with given cardinality of the boundary in bipartite graphs (Russian). Metody Diskret. Analiz 45, 42\u201370 (1987)","journal-title":"Metody Diskret. Analiz"},{"key":"128_CR30","doi-asserted-by":"crossref","unstructured":"Stein, S.K.: Two combinatorial covering theorems. J. Comb. Theory Ser. A 16(3), 391\u2013397 (1974)","DOI":"10.1016\/0097-3165(74)90062-4"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00128-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00128-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00128-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T13:39:33Z","timestamp":1741354773000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00128-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,2]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["128"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00128-w","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,2]]},"assertion":[{"value":"29 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"7"}}