Table of Contents
Fetching ...

Tiny non-Leighton complexes

Natalia S. Dergacheva, Anton A. Klyachko

Abstract

How complex must two finite 2-complexes be to admit a common, but not finite common, covering? We obtain an almost answer: the minimum possible number of triangles in a pseudo-simplicial triangulation of each complex is 3, 4, or 5.

Tiny non-Leighton complexes

Abstract

How complex must two finite 2-complexes be to admit a common, but not finite common, covering? We obtain an almost answer: the minimum possible number of triangles in a pseudo-simplicial triangulation of each complex is 3, 4, or 5.
Paper Structure (10 equations)

This paper contains 10 equations.