Ruy Fabila-Monroy (1) (2), David Flores-Peñaloza (3), Clemens Huemer (4), Ferran Hurtado (5), Jorge Urrutia (1) (2), David R. Wood (6)
(1) Instituto de Matematicas [México]
(2) Instituto de Matemáticas [México]
(3) Departamento de Matematicas [Mexico]
(4) Applied Mathematics IV Department
(5) Departament de Matemàtica Aplicada II
(6) Department of Mathematics and Statistics [Melbourne]
Abstract
This paper studies the chromatic number of the following four flip graphs (under suitable definitions of a flip): the flip graph of perfect matchings of a complete graph of even order, the flip graph of triangulations of a convex polygon (the associahedron), the flip graph of non-crossing Hamiltonian paths of a set of points in convex position, and the flip graph of triangles in a convex point set. We give tight bounds for the latter two cases and upper bounds for the first two.
