Pages that link to "Item:Q807642"

The following pages link to Compressions and isoperimetric inequalities (Q807642):

Displaying 50 items.

• A problem of Shapozenko on Johnson graphs (Q283683) (← links)
• Network decontamination with a single agent (Q292259) (← links)
• Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
• Bandwidth and pathwidth of three-dimensional grids (Q534058) (← links)
• Isoperimetric inequalities and fractional set systems (Q807643) (← links)
• Planar lattice subsets with minimal vertex boundary (Q820851) (← links)
• Isoperimetric inequalities for faces of the cube and the grid (Q916673) (← links)
• Antibandwidth of three-dimensional meshes (Q960961) (← links)
• Bounds for cops and robber pursuit (Q991186) (← links)
• Communication tree problems (Q995575) (← links)
• Edge-isoperimetric inequalities in the grid (Q1181010) (← links)
• How many lions are needed to clear a grid? (Q1662492) (← links)
• Counting sets with small sumset and applications (Q1701347) (← links)
• Union of shadows (Q1885044) (← links)
• Isoperimetric inequality on a metric measure space and Lipschitz order with an additive error (Q2074488) (← links)
• Interpolating between volume and lattice point enumerator with successive minima (Q2155979) (← links)
• Catching an infinitely fast robber on a grid (Q2166261) (← links)
• Isoperimetry, stability, and irredundance in direct products (Q2182213) (← links)
• Triangulations and a discrete Brunn-Minkowski inequality in the plane (Q2197692) (← links)
• Stability for vertex isoperimetry in the cube (Q2200919) (← links)
• Uniqueness in Harper's vertex-isoperimetric theorem (Q2297717) (← links)
• A lower bound for the vertex boundary-width of complete \(k\)-ary trees (Q2427498) (← links)
• Shadows of ordered graphs (Q2431242) (← links)
• The sub-Gaussian constant and concentration inequalities (Q2472751) (← links)
• Discrepancies of spanning trees and Hamilton cycles (Q2668020) (← links)
• Symmetry breaking in two-dimensional square grids: persistence and failure of the dimensional crossover (Q2668974) (← links)
• A Brunn-Minkowski inequality for the integer lattice (Q2723461) (← links)
• Frankl-Rödl-type theorems for codes and permutations (Q2833012) (← links)
• Connectivity threshold of Bluetooth graphs (Q2874082) (← links)
• Compressions and Probably Intersecting Families (Q2883868) (← links)
• Entropy and set cardinality inequalities for partition-determined functions (Q2904591) (← links)
• Antibandwidth of Three-Dimensional Meshes (Q3439580) (← links)
• Large Monochromatic Components in Two-colored Grids (Q3503446) (← links)
• Concentration on the Discrete Torus Using Transportation (Q3552508) (← links)
• On Canonical Concurrent Flows, Crossing Number and Graph Expansion (Q4325335) (← links)
• (Q4461636) (← links)
• (Q4461637) (← links)
• Isoperimetry in integer lattices (Q4645032) (← links)
• Vertex isoperimetry and independent set stability for tensor powers of cliques (Q5002636) (← links)
• On theorems of Wirsing and Sanders (Q5226456) (← links)
• A Stability Result for the Union-Closed Size Problem (Q5366897) (← links)
• Percolation of finite clusters and infinite surfaces (Q5408701) (← links)
• Efficient embeddings of grids into grids (Q5928873) (← links)
• Isoperimetric stability in lattices (Q6073680) (← links)
• The one-visibility localization game (Q6073890) (← links)
• Random interlacement is a factor of i.i.d. (Q6165199) (← links)
• On the volume of the Minkowski sum of zonoids (Q6184860) (← links)
• Dimension-free estimates on distances between subsets of volume \(\varepsilon\) inside a unit-volume body (Q6187862) (← links)
• Rearrangement inequalities on the lattice graph (Q6634554) (← links)
• On the independence number of sparser random Cayley graphs (Q6658771) (← links)