Maximal sets of given diameter in the grid and the torus

DOI10.1016/0012-365X(93)90284-ZzbMath0794.05053OpenAlexW2072500693WikidataQ127673949 ScholiaQ127673949MaRDI QIDQ1313846

Béla Bollobás, Imre Leader

Publication date: 10 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90284-z

zbMATH Keywords

distanceisoperimetric inequalitiesdiameterdiscrete torusgrid graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05)

Related Items (3)

An Erdős-Ko-Rado theorem for signed sets ⋮ On subsets of the hypercube with prescribed Hamming distances ⋮ A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets

Cites Work

• Unnamed Item
• Unnamed Item
• Isoperimetric inequalities and fractional set systems
• Radius and diameter in Manhattan lattices
• Extremal Configurations on a Discrete Torus and a Generalization of the Generalized Macaulay Theorem
• An Isoperimetric Inequality on the Discrete Torus
• On a combinatorial conjecture of Erdös
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: Maximal sets of given diameter in the grid and the torus