A problem of Shapozenko on Johnson graphs

DOI10.1016/j.endm.2014.08.015zbMath1338.05047arXiv1604.05084OpenAlexW1965185976WikidataQ129557892 ScholiaQ129557892MaRDI QIDQ283683

Oriol Serra, Víctor Diego, Lluís Vena

Publication date: 13 May 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.05084

zbMATH Keywords

Johnson graphisoperimetric problemcolexicographicisoperimetricshift compression

Mathematics Subject Classification ID

Graph theory (05C99) Vertex degrees (05C07)

Related Items (max. 100)

On density of subgraphs of halved cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate vertex-isoperimetric inequality for \(r\)-sets
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs
• Compressions and isoperimetric inequalities
• A generalization of a theorem of Kruskal
• Families of finite sets with minimum shadows
• A short proof for a theorem of Harper about Hamming-spheres
• A note on the edges of the n-cube
• Problems in algebraic combinatorics
• A local-global principle for vertex-isoperimetric problems
• Disconnecting strongly regular graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A Simple Proof of the Karakhanyan–Riordan Theorem on the Even Discrete Torus
• Graphs with maximal number of adjacent pairs of edges
• An Ordering on the Even Discrete Torus
• An Isoperimetric Inequality on the Discrete Torus
• Nonexistence of a Kruskal–Katona type theorem for double-sided shadow minimization in the Boolean cube layer
• Remarks on an Edge Isoperimetric Problem
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: A problem of Shapozenko on Johnson graphs