{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:05:51Z","timestamp":1780743951199,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"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":[[2022,12]]},"DOI":"10.1007\/s00493-021-4729-9","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T13:17:03Z","timestamp":1647263823000},"page":"853-880","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Number of Maximal Independent Sets in the Hamming Cube"],"prefix":"10.1007","volume":"42","author":[{"given":"Jeff","family":"Kahn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinyoung","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"4729_CR1","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1016\/j.dam.2010.09.003","volume":"161","author":"D Duffus","year":"2013","unstructured":"D. Duffus, P. Frankl and V. R\u00f6dl: Maximal independent sets in the covering graph of the cube, Discrete Appl. Math 161 (2013), 1203\u20131208.","journal-title":"Discrete Appl. Math"},{"key":"4729_CR2","first-page":"19","volume-title":"Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973)","author":"P Erd\u0151s","year":"1976","unstructured":"P. Erd\u0151s, D. J. Kleitman and B. L. Rothschild: Asymptotic enumeration of Kn-free graphs, in: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973) Tomo II, Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 19\u201327, 1976."},{"key":"4729_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02783426","volume":"138","author":"D Galvin","year":"2003","unstructured":"D. Galvin: On homomorphisms from the Hamming cube to Z, Israel J. Math 138 (2003), 189\u2013213.","journal-title":"Israel J. Math"},{"key":"4729_CR4","unstructured":"D. Galvin: Independent sets in the discrete hypercube, arXiv:1901.01991 [math.CO]"},{"key":"4729_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1017\/S0963548303006035","volume":"13","author":"D Galvin","year":"2004","unstructured":"D. Galvin and J. Kahn: On phase transition in the hard-core model on \u2124d, Combin. Probab. Comput. 13 (2004), 137\u2013164.","journal-title":"Combin. Probab. Comput."},{"key":"4729_CR6","unstructured":"A. Hamm and J. Kahn: On Erd\u0151s-Ko-Rado for random hypergraphs II, Combin. Probab. Comput., to appear."},{"key":"4729_CR7","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1137\/0406022","volume":"6","author":"M Hujter","year":"1993","unstructured":"M. Hujter and Z. Tuza: The number of maximal independent sets in triangle-free graphs, SIAM J. Discrete Math 6 (1993), 284\u2013288.","journal-title":"SIAM J. Discrete Math"},{"key":"4729_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11083-012-9253-5","volume":"30","author":"L Ilinca","year":"2013","unstructured":"L. Ilinca and J. Kahn: Counting maximal antichains and independent sets, Order 30 (2013), 427\u2013435.","journal-title":"Order"},{"key":"4729_CR9","unstructured":"M. Jenssen and P. Keevash: Homomorphisms from the torus, arXiv:2009.08315 [math.CO]."},{"key":"4729_CR10","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1112\/jlms.12331","volume":"102","author":"M Jenssen","year":"2020","unstructured":"M. Jenssen and W. Perkins: Independent sets in the hypercube revisited, J. Lond. Math. Soc. 102 (2020), 645\u2013669.","journal-title":"J. Lond. Math. Soc."},{"key":"4729_CR11","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1090\/proc\/15105","volume":"148","author":"J Kahn","year":"2020","unstructured":"J. Kahn and J. Park: An isoperimetric inequality for the Hamming cube and some consequences, Proc. Amer. Math. Soc., 148 (2020), 4213\u20134224.","journal-title":"Proc. Amer. Math. Soc."},{"key":"4729_CR12","doi-asserted-by":"publisher","first-page":"1.59","DOI":"10.37236\/8530","volume":"27","author":"J Kahn","year":"2020","unstructured":"J. Kahn and J. Park: Stability for maximal independent sets, Electron. J. Combin. 27 (2020), P 1.59.","journal-title":"Electron. J. Combin."},{"key":"4729_CR13","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s11856-020-1984-1","volume":"236","author":"J Kahn","year":"2020","unstructured":"J. Kahn and J. Park: The number of 4-colorings of the Hamming cube, Israel J. Math. 236 (2020), 629\u2013649.","journal-title":"Israel J. Math."},{"key":"4729_CR14","volume-title":"The art of computer programming","author":"D Knuth","year":"1969","unstructured":"D. Knuth: The art of computer programming Vol. I, Addison Wesley, London, 1969."},{"key":"4729_CR15","first-page":"5","volume":"38","author":"A D Korshunov","year":"1980","unstructured":"A. D. Korshunov: The number of monotone Boolean functions, Problemy Kibernet 38 (1980), 5\u2013108, in Russian.","journal-title":"Problemy Kibernet"},{"key":"4729_CR16","first-page":"111","volume":"40","author":"A D Korshunov","year":"1983","unstructured":"A. D. Korshunov and A. A. Sapozhenko: The number of binary codes with distance 2, Problemy Kibernet 40 (1983), 111\u2013130, in Russian.","journal-title":"Problemy Kibernet"},{"key":"4729_CR17","unstructured":"J. Park: Note on the number of balanced independent sets in the Hamming cube, arXiv:2103.11198 [math.CO]."},{"key":"4729_CR18","unstructured":"R. Peled and Y. Spinka: Rigidity of proper colorings of \u2124d, arXiv:1808.03597 [math.PR]."},{"key":"4729_CR19","first-page":"42","volume":"45","author":"A A Sapozhenko","year":"1987","unstructured":"A. A. Sapozhenko: On the number of connected subsets with given cardinality of the boundary in bipartite graphs, Metody Diskret. Analiz. 45 (1987), 42\u201370, in Russian.","journal-title":"Metody Diskret. Analiz."},{"key":"4729_CR20","first-page":"74","volume":"1","author":"A A Sapozhenko","year":"1989","unstructured":"A. A. Sapozhenko: The number of antichains in ranked partially ordered sets, Diskret. Mat. 1 (1989), 74\u201393, in Russian; translation in Discrete Math. Appl. 1 (1991), 35\u201358.","journal-title":"Diskret. Mat."},{"key":"4729_CR21","first-page":"110","volume":"1","author":"A A Sapozhenko","year":"1989","unstructured":"A. A. Sapozhenko: The number of antichains in multilayered ranked sets, Diskret. Mat. 1 (1989), 110\u2013128, in Russian; translation in Discrete Math. Appl. 1 (1991), 149\u2013169.","journal-title":"Diskret. Mat."},{"key":"4729_CR22","doi-asserted-by":"publisher","first-page":"116","DOI":"10.3103\/S0027132207030072","volume":"62","author":"A A Sapozhenko","year":"2007","unstructured":"A. A. Sapozhenko: The number of independent sets in graphs, Moscow Univ. Math. Bull. 62 (2007), 116\u2013118.","journal-title":"Moscow Univ. Math. Bull."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4729-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-021-4729-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4729-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T13:05:38Z","timestamp":1670677538000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-021-4729-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4729"],"URL":"https:\/\/doi.org\/10.1007\/s00493-021-4729-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"16 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}