The combinatorial cost
群论
2007-05-23 v1 组合数学
摘要
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 -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 homology gradient invariants introduced by Lackenby for residually finite groups.
关键词
引用
@article{arxiv.math/0608474,
title = {The combinatorial cost},
author = {Gábor Elek},
journal= {arXiv preprint arXiv:math/0608474},
year = {2007}
}