The combinatorial cost
| dc.creator | Elek, Gábor | |
| dc.date | 2006-08-18 | |
| dc.date.accessioned | 2026-07-07T07:21:55Z | |
| dc.date.available | 2026-07-07T07:21:55Z | |
| dc.description | We study the combinatorial analogues of the classical invariants of measurable equivalence relations. We introduce the notion of cost and $β$-invariants (the analogue of the first $L^2$-Betti number introduced by Gaboriau) for sequences of finite graphs with uniformly bounded vertex degrees and examine the relation of these invariants and the rank gradient resp. mod $p$ homology gradient invariants introduced by Lackenby for residually finite groups. | |
| dc.identifier | https://arxiv.org/abs/math/0608474 | |
| dc.identifier | http://arxiv.org/abs/math/0608474 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115475 | |
| dc.subject | Group Theory | |
| dc.subject | Combinatorics | |
| dc.subject | 20F65 | |
| dc.title | The combinatorial cost | |
| dc.type | text |