Edge-isoperimetric inequalities in the grid (Q1181010): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Maximally Connected Arrays on the <i>n</i>-Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressions and isoperimetric inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of Lattice Points which Contain a Maximal Number of Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the edges of the n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Configurations Maximizing the Number of Pairs of Hamming‐Adjacent Lattice Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Isoperimetric Problems / rank
 
Normal rank

Revision as of 13:15, 15 May 2024

scientific article
Language Label Description Also known as
English
Edge-isoperimetric inequalities in the grid
scientific article

    Statements

    Edge-isoperimetric inequalities in the grid (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    This paper gives a lower bound on the number of edges between a subset of a grid graph and its complement. The bound is essentially sharp.
    0 references
    edge-isoperimetric inequalities
    0 references
    lower bound
    0 references
    grid graph
    0 references

    Identifiers