scientific article; zbMATH DE number 1303526
From MaRDI portal
Publication:4250148
zbMath0927.05080MaRDI QIDQ4250148
Publication date: 13 December 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
lexicographic orderisoperimetric inequalityisoperimetric problemlocal-global principlegraph partitions
Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Edge isoperimetric inequalities for powers of the hypercube, Planar lattice subsets with minimal vertex boundary, Edge-isoperimetric problems for Cartesian powers of regular graphs, Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes, On mixing and edge expansion properties in randomized broadcasting, Edge-Isoperimetric Problem for Cayley Graphs and Generalized Takagi Functions, The \(S\)-\textsc{labeling} problem: an algorithmic tour, Droplet states in quantum XXZ spin systems on general graphs, A new approach to Macaulay posets, Shadows under the word-subword relation, On partitioning of hypergraphs, On the number of hypercubic bipartitions of an integer, Pull-push method: a new approach to edge-isoperimetric problems, The one-visibility localization game, Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees, On \(k\)-ary \(n\)-cubes: Theory and applications., Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength, The double-bubble problem on the square lattice, An extremal graph problem on a grid and an isoperimetric problem for polyominoes, On linear layout of bicube and construction of optimal incomplete bicube, A lower bound for the vertex boundary-width of complete \(k\)-ary trees, Isoperimetric Problem and Meta-fibonacci Sequences, Minimum Linear Arrangement of Generalized Sierpinski Graphs, New infinite family of regular edge-isoperimetric graphs, Embedding of hypercubes into necklace, windmill and snake graphs, Maximal fluctuations around the Wulff shape for edge-isoperimetric sets in \({\mathbb{Z}}^d \): a sharp scaling law, The bisection width and the isoperimetric number of arrays., A note on minimum linear arrangement for BC graphs, The spider poset is Macaulay, Approximate convexity and an edge-isoperimetric estimate, On the structure of subsets of the discrete cube with small edge boundary, Sharp \(N^{3/4}\) law for the minimizers of the edge-isoperimetric problem on the triangular lattice, Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees, Wirelength of hypercubes into certain trees, The vertex isoperimetric problem for the powers of the diamond graph, Linear layout of locally twisted cubes, Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs, Bounds on isoperimetric values of trees, Spatio-spectral limiting on discrete tori: adjacency invariant spaces, On density of subgraphs of halved cubes, Unnamed Item, On the isoperimetric number of a \(k\)-degree Cayley graph, On minimum cuts and the linear arrangement problem, Edge-isoperimetric inequalities and ball-noise stability: linear programming and probabilistic approaches, On spanning tree congestion of graphs, \(N^{3/4}\) law in the cubic lattice, On an equivalence in discrete extremal problems
