Edge isoperimetric theorems for integer point arrays (Q1893693): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Edge-isoperimetric inequalities in the grid / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Assignments of Numbers to Vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Assignment of Numbers to Vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs with maximal number of adjacent pairs of edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A necessary condition on minimal cube numberings / rank | |||
Normal rank | |||
Latest revision as of 14:38, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge isoperimetric theorems for integer point arrays |
scientific article |
Statements
Edge isoperimetric theorems for integer point arrays (English)
0 references
20 July 1995
0 references
The authors consider \(m\)-vertex subsets of the Cartesian product of \(n\) paths and those of them which have maximal number of induced edges of the grid and those which are separable from their complement by the least number of edges. They generalize and extend results of \textit{B. Bollobás} and \textit{I. Leader} [Edge-isoperimetric inequalities in the grid, Combinatorica 11, No. 4, 299-314 (1991; Zbl 0755.05045)].
0 references
Cartesian product
0 references
paths
0 references
grid
0 references
