Optimization in graphical small cancellation theory

DOI10.1016/j.disc.2023.113842arXiv2306.03474OpenAlexW4379958906MaRDI QIDQ6197706

Unnamed Author, Louis Esperet

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphlabellinggraphical cancellation

Mathematics Subject Classification ID

Geometric group theory (20F65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Cancellation theory of groups; application of van Kampen diagrams (20F06) Infinite graphs (05C63)

Cites Work

• Cubic Ramanujan graphs
• Random walk in random groups.
• Combinatorial group theory.
• Another approach to non-repetitive colorings of graphs of bounded degree
• Acyclic coloring of graphs and entropy compression method
• On a small cancellation theorem of Gromov.
• Small cancellation labellings of some infinite graphs and applications
• Expander graphs and their applications
• A constructive proof of the general lovász local lemma
• Admitting a Coarse Embedding is Not Preserved Under Group Extensions
• Groups with graphical 𝐶(6) and 𝐶(7) small cancellation presentations

This page was built for publication: Optimization in graphical small cancellation theory