Show simple item record

dc.contributor.authorDiego Gutiérrez, Victor
dc.contributor.authorSerra Albó, Oriol
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2018-10-30T10:42:58Z
dc.date.available2019-09-01T00:25:28Z
dc.date.issued2018-09
dc.identifier.citationDiego , V., Serra, O. On a problem by Shapozenko on Johnson Graphs. "Graphs and combinatorics", Setembre 2018, vol. 34, núm. 5, p. 947-964.
dc.identifier.issn0911-0119
dc.identifier.urihttp://hdl.handle.net/2117/123217
dc.descriptionThe final publication is available at Springer via http://dx.doi.org/10.1007/s00373-018-1923-7
dc.description.abstractThe 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=(nm) . 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 .
dc.format.extent18 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica
dc.subject.lcshGraph theory
dc.subject.otherJohnson graph
dc.subject.otherIsoperimetric problem
dc.subject.otherShift compression
dc.titleOn a problem by Shapozenko on Johnson Graphs
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics
dc.identifier.doi10.1007/s00373-018-1923-7
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::05 Combinatorics::05C Graph theory
dc.relation.publisherversionhttps://link.springer.com/article/10.1007%2Fs00373-018-1923-7
dc.rights.accessOpen Access
drac.iddocument23309749
dc.description.versionPostprint (author's final draft)
upcommons.citation.authorDiego, V.; Serra, O.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameGraphs and combinatorics
upcommons.citation.volume34
upcommons.citation.number5
upcommons.citation.startingPage947
upcommons.citation.endingPage964


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder