On measure concentration in graph products
Bollobás and Leader [1] showed that among the n-fold products of connected graphs of order k the one with minimal t-boundary is the grid graph. Given any product graph G and a set A of its vertices that contains at least half of V (G), the number of vertices at a distance at least t from A decays (...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius University Press
2009-12-01
|
| Series: | Lietuvos Matematikos Rinkinys |
| Subjects: | |
| Online Access: | https://www.journals.vu.lt/LMR/article/view/18039 |
