Independent sets in tensor graph powers
| dc.creator | Alon, Noga | |
| dc.creator | Lubetzky, Eyal | |
| dc.date | 2006-08-03 | |
| dc.date.accessioned | 2026-07-07T07:21:21Z | |
| dc.date.available | 2026-07-07T07:21:21Z | |
| dc.description | The tensor product of two graphs, $G$ and $H$, has a vertex set $V(G)\times V(H)$ and an edge between $(u,v)$ and $(u',v')$ iff both $u u' \in E(G)$ and $v v' \in E(H)$. Let $A(G)$ denote the limit of the independence ratios of tensor powers of $G$, $\lim α(G^n)/|V(G^n)|$. This parameter was introduced by Brown, Nowakowski and Rall, who showed that $A(G)$ is lower bounded by the vertex expansion ratio of independent sets of $G$. In this note we study the relation between these parameters further, and ask whether they are in fact equal. We present several families of graphs where equality holds, and discuss the effect the above question has on various open problems related to tensor graph products. | |
| dc.identifier | https://arxiv.org/abs/math/0608090 | |
| dc.identifier | http://arxiv.org/abs/math/0608090 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115274 | |
| dc.subject | Combinatorics | |
| dc.title | Independent sets in tensor graph powers | |
| dc.type | text |