A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
On a Problem by Shapozenko on Johnson Graphs
2018
Graphs and Combinatorics
The Johnson graph J(n, m) has the m-subsets of {1, 2, . . . , n} as vertices and two subsets are adjacent in the graph if they share m−1 elements. Shapozenko asked about the isoperimetric function µn,m(k) of Johnson graphs, that is, the cardinality of the smallest boundary of sets with k vertices in J(n, m) for each 1 ≤ k ≤ n m . We give an upper bound for µn,m(k) and show that, for each given k such that the solution to the Shadow Minimization Problem in the Boolean lattice is unique, and each
doi:10.1007/s00373-018-1923-7
fatcat:o762ushckjfmlcvkgbsnnrcmge