Burnside's problem, spanning trees and tilings.
DOI10.2140/gt.2014.18.179zbMath1338.20041arXiv1104.1231OpenAlexW2068251269MaRDI QIDQ2636582
Publication date: 30 January 2014
Published in: Geometry \& Topology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1231
finitely generated groupsCayley graphstilingsHamiltonian pathsends of groupstilesBurnside problemspanning treesvon Neumann conjectureLovász conjecturefinitely generated infinite groupstranslation-like actions
Periodic groups; locally finite groups (20F50) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Means on groups, semigroups, etc.; amenable groups (43A07) Infinite graphs (05C63)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian paths in Cayley graphs
- Elementary amenable groups
- Every graph with a positive Cheeger constant contains a tree with a positive Cheeger constant
- Homogeneous trees are bilipschitz equivalent
- Amenability, bi-Lipschitz equivalence, and the von Neumann conjecture
- Branched Coverings of Cubical Complexes and Subgroups of Hyperbolic Groups
- Group Colorings and Bernoulli Subflows