Monochromatic subgraphs in iterated triangulations (Q2209888)

Summary: For integers \(n\geqslant 0\), an iterated triangulation \(\text{Tr}(n)\) is defined recursively as follows: \(\text{Tr}(0)\) is the plane triangulation on three vertices and, for \(n\geqslant 1, \text{Tr}(n)\) is the plane triangulation obtained from the plane triangulation \(\text{Tr}(n-1)\) by, for each inner face \(F\) of \(\text{Tr}(n-1)\), adding inside \(F\) a new vertex and three edges joining this new vertex to the three vertices incident with \(F\). In this paper, we show that there exists a 2-edge-coloring of \(\text{Tr}(n)\) such that \(\text{Tr}(n)\) contains no monochromatic copy of the cycle \(C_k\) for any \(k\geqslant 5\). As a consequence, the answer to one of two questions asked by \textit{M. Axenovich} et al. [Electron. J. Comb. 26, No. 4, Research Paper P4.9, 15 p. (2019; Zbl 1422.05066)] is negative. We also determine the radius 2 graphs \(H\) for which there exists \(n\) such that every 2-edge-coloring of \(\text{Tr}(n)\) contains a monochromatic copy of \(H\), extending a result of Axenovich et al. [loc. cit,] for radius 2 trees.