2016/04/18 by Víctor Diego, Diego, Víctor, Oriol Serra +3
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1604.05084
15 pages, 1 figure. Improved version with the comments from the referees
arxiv created 2017/02/07 · arxiv updated 2017/02/09
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\choose 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 sufficiently large n, the given upper bound is tight. We also show that the bound is tight for the small values of k≤ m+1 and for all values of k when m=2.