Edge isoperimetric theorems for integer point arrays

DOI10.1016/0893-9659(95)00015-IzbMath0830.05040MaRDI QIDQ1893693

Sergei L. Bezrukov

Publication date: 20 July 1995

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

pathsCartesian productgrid

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (16)

Edge-isoperimetric problems for Cartesian powers of regular graphs ⋮ Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path ⋮ Pull-push method: a new approach to edge-isoperimetric problems ⋮ On \(k\)-ary \(n\)-cubes: Theory and applications. ⋮ An extremal graph problem on a grid and an isoperimetric problem for polyominoes ⋮ Reflect-push methods. Part I: Two dimensional techniques ⋮ Maximal fluctuations around the Wulff shape for edge-isoperimetric sets in \({\mathbb{Z}}^d \): a sharp scaling law ⋮ Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem ⋮ VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH ⋮ Escaping offline searchers and isoperimetric theorems ⋮ Efficient embeddings of grids into grids ⋮ The carving-width of generalized hypercubes ⋮ Unnamed Item ⋮ A new lower bound for the bipartite crossing number with applications ⋮ THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS ⋮ On an equivalence in discrete extremal problems

Cites Work

• Edge-isoperimetric inequalities in the grid
• Graphs with maximal number of adjacent pairs of edges
• Assignment of Numbers to Vertices
• A necessary condition on minimal cube numberings
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Edge isoperimetric theorems for integer point arrays