Hamann, Matthias

1. A Stallings' type theorem for quasi-transitive graphs
   2018/12/15 by Hamann, Matthias, Lehner, Florian, Miraftab, Babak +1 · 3 citations
   #Combinatorics (math.CO) #FOS: Mathematics
2. On the tree-likeness of hyperbolic spaces
   2011/05/19 by Hamann, Matthias · 2 citations
   #FOS: Mathematics #Metric Geometry (math.MG)
3. Group actions on metric spaces: fixed points and free subgroups
   2013/01/28 by Hamann, Matthias · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)
4. Accessibility in transitive graphs
   2014/04/30 by Hamann, Matthias · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR)
5. The planar Cayley graphs are effectively enumerable II
   2019/01/02 by Agelos Georgakopoulos, Georgakopoulos, Agelos, Matthias Hamann +1 · 1 citation
   Biochemistry, Genetics and Molecular Biology · Computer Science · #05C10 (secondary) #05C25 #20F05 (primary) #Advanced Graph Theory Research #Combinatorics (math.CO) #DNA and Biological Computing #FOS: Mathematics #Group Theory (math.GR) #semigroups and automata theory
6. Canonical trees of tree-decompositions
   2020/02/27 by Carmesin, Johannes, Hamann, Matthias, Miraftab, Babak · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
7. Minor exclusion in quasi-transitive graphs
   2021/10/25 by Hamann, Matthias · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
8. A full Halin grid theorem
   2024/03/09 by Georgakopoulos, Agelos, Hamann, Matthias · 2 citations
   #Combinatorics (math.CO) #FOS: Mathematics