{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:44Z","timestamp":1740107144457,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T00:00:00Z","timestamp":1531872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Secretar\u00eda de Estado de Investigaci\u00f3n, Desarrollo e Innovaci\u00f3n (ES)","award":["MTM2011-28800-C02-01"],"award-info":[{"award-number":["MTM2011-28800-C02-01"]}]},{"name":"Secretar\u00eda de Estado de Investigaci\u00f3n, Desarrollo e Innovaci\u00f3n","award":["MTM2014-54745-P"],"award-info":[{"award-number":["MTM2014-54745-P"]}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["P202\/12\/G061"],"award-info":[{"award-number":["P202\/12\/G061"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00373-018-1923-7","type":"journal-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T00:50:02Z","timestamp":1531961402000},"page":"947-964","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a Problem by Shapozenko on Johnson Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"V\u00edctor","family":"Diego","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oriol","family":"Serra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Llu\u00eds","family":"Vena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"1923_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01902206","volume":"32","author":"R Ahlswede","year":"1978","unstructured":"Ahlswede, R., Katona, G.O.: Graphs with maximal number of adjacent pairs of edges. Acta Math. Acad. Sci. Hungar. 32, 97\u2013120 (1978)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"1923_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2478\/ausi-2014-0004","volume":"5","author":"M Bashov","year":"2014","unstructured":"Bashov, M.: Nonexistence of a Kruskal\u2013Katona type theorem for double-sided shadow minimization in the Boolean cube layer. Acta Univ. Sapientiae Inform. 5, 53\u201362 (2014)","journal-title":"Acta Univ. Sapientiae Inform."},{"key":"1923_CR3","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/11889342_62","volume-title":"Remarks on an Edge-Isoperimetric Problem, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science","author":"C Bey","year":"2006","unstructured":"Bey, C.: Remarks on an Edge-Isoperimetric Problem, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, vol. 4123, pp. 971\u2013978. Springer, Berlin (2006)"},{"key":"1923_CR4","unstructured":"Bezrukov, S.L.: An isoperimetric problem for Manhattan lattices. In: Proceedings International Conference on Finite and Infinite Sets, Budapest (1990)"},{"key":"1923_CR5","first-page":"59","volume":"3","author":"SL Bezrukov","year":"1994","unstructured":"Bezrukov, S.L.: Isoperimetric problems in discrete spaces Extremal problems for finite sets (Visegr\u00e1d, 1991). Bolyai Soc. Math. Stud. 3 J\u00e1nos Bolyai Math. Soc. Bp. 3, 59\u201391 (1994)","journal-title":"Bolyai Soc. Math. Stud. 3 J\u00e1nos Bolyai Math. Soc. Bp."},{"key":"1923_CR6","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1137\/080715081","volume":"23","author":"SL Bezrukov","year":"2009","unstructured":"Bezrukov, S.L., Leck, U.: A simple proof of the Karakhanyan\u2013Riordan theorem on the even discrete torus. SIAM J. Discret. Math. 23, 1416\u20131421 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"1923_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0012-365X(02)00431-4","volume":"257","author":"SL Bezrukov","year":"2002","unstructured":"Bezrukov, S.L., Serra, O.: A local\u2013global principle for vertex-isoperimetric problems. Discret. Math. 257, 285\u2013309 (2002)","journal-title":"Discret. Math."},{"key":"1923_CR8","volume-title":"Combinatorics, Set Systems, Hypergraphs. Families of Vectors and Combinatorial Probability","author":"B Bollob\u00e1s","year":"1986","unstructured":"Bollob\u00e1s, B.: Combinatorics, Set Systems, Hypergraphs. Families of Vectors and Combinatorial Probability. Cambridge University Press, Cambridge (1986)"},{"key":"1923_CR9","first-page":"32","volume":"3","author":"B Bollob\u00e1s","year":"1990","unstructured":"Bollob\u00e1s, B.: An isoperimetric inequality on the discrete torus. SIAM J. Appl. Math. 3, 32\u201337 (1990)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"1923_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0097-3165(91)90021-8","volume":"56","author":"B Bollob\u00e1s","year":"1991","unstructured":"Bollob\u00e1s, B., Leader, I.: Compressions and isoperimetric inequalities. J. Combin. Theory Ser. A 56(1), 47\u201362 (1991)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1923_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1017\/S0963548304006078","volume":"13","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B., Leader, I.: Isoperimetric inequalities for r-sets. Combin. Prob. Comput. 13, 277\u2013279 (2004)","journal-title":"Combin. Prob. Comput."},{"key":"1923_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer, A.E., Cohen, A., Neumaier, A.: Distance-Regular Graphs. Springer, Berlin (1989)"},{"key":"1923_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511623677","volume-title":"Permutation Groups. London Mathematical Society Student Texts","author":"PJ Cameron","year":"1999","unstructured":"Cameron, P.J.: Permutation Groups. London Mathematical Society Student Texts, vol. 45. Cambridge University Press, Cambridge (1999)"},{"key":"1923_CR14","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.jcta.2012.01.001","volume":"119","author":"SM Cioab\u01ce","year":"2012","unstructured":"Cioab\u01ce, S.M., Kim, K., Koolen, J.H.: On a conjecture of Brouwer involving the connectivity of strongly regular graphs. J. Comb. Theory Ser. A 119, 904\u2013922 (2012)","journal-title":"J. Comb. Theory Ser. A"},{"key":"1923_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2013.10.008","volume":"38","author":"SM Cioab\u01ce","year":"2014","unstructured":"Cioab\u01ce, S.M., Koolen, J.H., Li, W.: Disconnecting strongly regular graphs. Eur. J. Comb. 38, 1\u201311 (2014)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"1923_CR16","first-page":"Paper 15, 12","volume":"20","author":"D Christofides","year":"2013","unstructured":"Christofides, D., Ellis, D., Keevash, P.: An approximate isoperimetric inequality for r-sets. Electron. J. Comb. 20(4), Paper 15, 12 (2013)","journal-title":"Electron. J. Comb."},{"key":"1923_CR17","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Quart. J. Math. Oxf. Ser. (2) 12, 313\u2013320 (1961)","journal-title":"Quart. J. Math. Oxf. Ser. (2)"},{"issue":"3","key":"1923_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0012-365X(81)90009-1","volume":"34","author":"P Frankl","year":"1981","unstructured":"Frankl, P., F\u00fcredi, Z.: A short proof for a theorem of Harper about Hamming-spheres. Discret. Math. 34(3), 311\u2013313 (1981)","journal-title":"Discret. Math."},{"key":"1923_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF02579261","volume":"6","author":"Z F\u00fcredi","year":"1986","unstructured":"F\u00fcredi, Z., Griggs, J.R.: Families of finite sets with minimum shadows. Combinatorica 6, 355\u2013363 (1986)","journal-title":"Combinatorica"},{"key":"1923_CR20","volume-title":"Algebraic Combinatorics. Chapman and Hall Mathematics Series I","author":"CD Godsil","year":"1993","unstructured":"Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall Mathematics Series I. Chapman & Hall, New York (1993)"},{"key":"1923_CR21","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"LH Harper","year":"1966","unstructured":"Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. J. Comb. Theory 1, 385\u2013393 (1966)","journal-title":"J. Comb. Theory"},{"key":"1923_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511616679","volume-title":"Global Methods for Combinatorial Isoperimetric Problems. Cambridge Studies in Advanced Mathematics, 90","author":"LH Harper","year":"2004","unstructured":"Harper, L.H.: Global Methods for Combinatorial Isoperimetric Problems. Cambridge Studies in Advanced Mathematics, 90. Cambridge University Press, Cambridge (2004)"},{"key":"1923_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0012-365X(76)90058-3","volume":"14","author":"S Hart","year":"1976","unstructured":"Hart, S.: A note on the edges of the $$n$$ n -cube. Discret. Math. 14, 157\u2013163 (1976)","journal-title":"Discret. Math."},{"issue":"2","key":"1923_CR24","first-page":"61","volume":"LXXIV","author":"VM Karachanjan","year":"1982","unstructured":"Karachanjan, V.M.: A discrete isoperimetric problem on multidimensional torus (in Russian). Doklady AN Arm. SSR LXXIV(2), 61\u201365 (1982)","journal-title":"Doklady AN Arm. SSR"},{"key":"1923_CR25","first-page":"187","volume-title":"A Theorem of Finite Sets. Theory of Graphs (Proc. Colloq., Tihany, 1966)","author":"GOH Katona","year":"1968","unstructured":"Katona, G.O.H.: A Theorem of Finite Sets. Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 187\u2013207. Academic Press, London (1968)"},{"key":"1923_CR26","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1525\/9780520319875-014","volume-title":"The Number of Simplices in a Complex. Mathematical Optimization Techniques","author":"JB Kruskal","year":"1963","unstructured":"Kruskal, J.B.: The Number of Simplices in a Complex. Mathematical Optimization Techniques, pp. 251\u2013278. University of California Press, Berkeley (1963)"},{"key":"1923_CR27","doi-asserted-by":"crossref","unstructured":"Leader, I.: Discrete Isoperimetric Inequalities. Probabilistic Combinatorics and Its Applications (San Francisco, CA, 1991).Proceedings of Symposium in Applied Mathematics, 44, American Mathematical Society, Providence, RI, pp. 57\u201380 (1991)","DOI":"10.1090\/psapm\/044\/1141923"},{"key":"1923_CR28","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF02582941","volume":"1","author":"Michael M\u00f6rs","year":"1985","unstructured":"M\u00f6rs, Michael: A generalization of a theorem of Kruskal. Gr. Comb. 1, 167\u2013183 (1985)","journal-title":"Gr. Comb."},{"key":"1923_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480194278234","volume":"11","author":"O Riordan","year":"1998","unstructured":"Riordan, O.: An ordering on the discrete even torus, 110\u2013127. SIAM J. Discret. Math. 11, 1 (1998)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1923-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1923-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1923-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T21:06:57Z","timestamp":1661634417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1923-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,18]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1923"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1923-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,7,18]]},"assertion":[{"value":"3 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}