Approximating Cayley Diagrams Versus Cayley Graphs

DOI10.1017/S0963548311000733zbMath1247.05106arXiv1103.4968OpenAlexW2056900544MaRDI QIDQ2908133

Ádám Timár

Publication date: 4 September 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.4968

zbMATH Keywords

Hamiltonian cyclegraph sequences

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Geometric group theory (20F65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Unnamed Item
• Hyperlinearity, essentially free actions and \(L^2\)-invariants. The sofic property
• Processes on unimodular random networks
• Borel oracles. An analytical approach to constant-time algorithms
• Hyperlinear and Sofic Groups: A Brief Guide

This page was built for publication: Approximating Cayley Diagrams Versus Cayley Graphs