{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T13:48:23Z","timestamp":1765806503877},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540294986"},{"type":"electronic","value":"9783540322450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11571155_1","type":"book-chapter","created":{"date-parts":[[2005,10,31]],"date-time":"2005-10-31T02:32:31Z","timestamp":1130725951000},"page":"1-13","source":"Crossref","is-referenced-by-count":7,"title":["Systems of Containers and Enumeration Problems"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Sapozhenko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02772952","volume":"73","author":"N. Alon","year":"1991","unstructured":"Alon, N.: Independent sets in regular graphs and Sum-Free Subsets of Finite Groups. Israel Journal of Math.\u00a073(2), 247\u2013256 (1991)","journal-title":"Israel Journal of Math."},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollobas","year":"2001","unstructured":"Bollobas, B.: Random Graphs, 2nd edn., p. 495. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Cameron, P., Erd\u0151s, P.: On the number of integers with various properties. In: Mollin, R.A. (ed.) Number Theory: Proc.\u00a0First Conf.\u00a0Can.\u00a0Number Th.\u00a0Ass., Banff, 1988, \u2014 de Gruyter, pp. 61\u201379 (1990)","DOI":"10.1515\/9783110848632-008"},{"issue":"13","key":"1_CR4","first-page":"202","volume":"6","author":"G.A. Freiman","year":"1959","unstructured":"Freiman, G.A.: Finite set addition. Izv.\u00a0Vyssh.\u00a0Uchebn.\u00a0Zaved., Matematika\u00a06(13), 202\u2013213 (1959)","journal-title":"Izv.\u00a0Vyssh.\u00a0Uchebn.\u00a0Zaved., Matematika"},{"issue":"6","key":"1_CR5","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1112\/S0024609304003650","volume":"36","author":"B. Green","year":"2004","unstructured":"Green, B.: The Cameron-Erdos conjecture. Bull.\u00a0Lond.\u00a0Math.\u00a0Soc.\u00a036(6), 769\u2013778 (2004)","journal-title":"Bull.\u00a0Lond.\u00a0Math.\u00a0Soc."},{"key":"1_CR6","first-page":"1088","volume":"262","author":"G. Hansel","year":"1966","unstructured":"Hansel, G.: Sur le nombre des fonctions booleen monotonesde n variables. C.R. Acad. Sci. Paris\u00a0262, 1088\u20131090 (1966)","journal-title":"C.R. Acad. Sci. Paris"},{"key":"1_CR7","unstructured":"Katerinochkina, N.n.: Searcing of maximum upper zero of monotone Boolean functions. Doklady Acad. Nauk of URSS\u00a0224(3), 557\u2013560 (1975) (in Russian)"},{"key":"1_CR8","unstructured":"Korobkov, V.K.: On monotone Boolean functions. Problemy Kibernetiki, M.\u00a0Nauka\u00a038, 5\u2013108 (1981) (in Russian)"},{"key":"1_CR9","unstructured":"Korshunov, A.D.: On the number of monotone Boolean functions. Problemy Kibernetiki, M.\u00a0Nauka\u00a013, 5\u201328 (1965) (in Russian)"},{"key":"1_CR10","first-page":"111","volume":"40","author":"A.D. Korshunov","year":"1993","unstructured":"Korshunov, A.D., Sapozhenko, A.A.: On the number of binary codes with distance two. Problemy Kibernetiki, M.\u00a0Nauka\u00a040, 111\u2013140 (1993) (in Russian)","journal-title":"Problemy Kibernetiki, M. Nauka"},{"issue":"347","key":"1_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF02773386","volume":"125","author":"V.F. Lev","year":"2001","unstructured":"Lev, V.F., Luczak, T., Schoen, T.: Sum-free sets in Abelian groups. Israel Journ.\u00a0Math.\u00a0125(347), 347\u2013367 (2001)","journal-title":"Israel Journ.\u00a0Math."},{"key":"1_CR12","first-page":"35","volume":"45","author":"A.A. Sapozhenko","year":"1987","unstructured":"Sapozhenko, A.A.: On the number of connected sets with given size of boundary in graphs. Metody diskretnoi matematiki v reshenii combinatornykh zadach, - Novosibirsk\u00a045, 35\u201358 (1987)","journal-title":"Metody diskretnoi matematiki v reshenii combinatornykh zadach, - Novosibirsk"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Sapozhenko, A.A.: On the number of antichains in posets. Discrete Mathematics and Applications\u00a01(1), 35\u201359","DOI":"10.1515\/dma.1991.1.1.35"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Sapozhenko, A.A.: On the number of antichains in multylevelled posets. Discrete Mathematics and Applications\u00a01(2), 149\u2013171","DOI":"10.1515\/dma.1991.1.2.149"},{"key":"1_CR15","first-page":"161","volume":"9","author":"A.A. Sapozhenko","year":"2000","unstructured":"Sapozhenko, A.A.: The Dedekind problem and boundary funcional method. Matematicheskie Voprosy Kibernetiki, M.\u00a0Fizmatlit\u00a09, 161\u2013220 (2000)","journal-title":"Matematicheskie Voprosy Kibernetiki, M.\u00a0Fizmatlit"},{"key":"1_CR16","unstructured":"Sapozhenko, A.A.: On the Number of Independent Sets in Bipartite Graphs with Large Minimum Degree. DIMACS Technical Report 2000-25, 24\u201331 (August 2000) (in Russian)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Sapozhenko, A.A.: On the Number of Independent Sets in expanders. Diskretnaya matematika, Moscow\u00a013(1), 56\u201362 (2001) (in Russian)","DOI":"10.4213\/dm276"},{"key":"1_CR18","first-page":"14","volume":"4","author":"A.A. Sapozhenko","year":"2002","unstructured":"Sapozhenko, A.A.: On the number of sum-free sets in Abelian groups. Vestnik Moskovskogo Universiteta, ser.\u00a0Math., Mech.\u00a04, 14\u201318 (2002) (Russian)","journal-title":"Vestnik Moskovskogo Universiteta, ser. Math., Mech."},{"key":"1_CR19","unstructured":"Sapozhenko, A.A.: The Cameron-Erdos conjecture. Doklady of Russian Academy of Sciences\u00a0393(6), 749\u2013752 (2003) (English Translation)"},{"issue":"12","key":"1_CR20","first-page":"1871","volume":"31","author":"A.A. Sapozhenko","year":"1991","unstructured":"Sapozhenko, A.A.: On searcing upper zeroes of monotone functions on ranked posets. Journal of Mathematical Physics and Computational Mathematics\u00a031(12), 1871\u20131884 (1991) (English translation)","journal-title":"Journal of Mathematical Physics and Computational Mathematics"},{"key":"1_CR21","unstructured":"Sapozhenko, A.A.: On the Number of Independent Sets in Graphs. Problems of theoretical cybernetics. In: Proceedings of XIII International Conference, Kazan, pp. 85\u201393, May 27-31 (2002)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Stepanov, V.E.: Phase transition in random graphs. Theory Probab.\u00a0Applcs\u00a015, 187\u2013203","DOI":"10.1137\/1115027"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11571155_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:40:29Z","timestamp":1619491229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11571155_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540294986","9783540322450"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11571155_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}