Flips in Colorful Triangulations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10493204" target="_blank" >RIV/00216208:11320/24:10493204 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.GD.2024.30" target="_blank" >https://doi.org/10.4230/LIPIcs.GD.2024.30</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.GD.2024.30" target="_blank" >10.4230/LIPIcs.GD.2024.30</a>
Alternative languages
Result language
angličtina
Original language name
Flips in Colorful Triangulations
Original language description
The associahedron is the graph G_N that has as nodes all triangulations of a convex N-gon, and an edge between any two triangulations that differ in a flip operation. A flip removes an edge shared by two triangles and replaces it by the other diagonal of the resulting 4-gon. In this paper, we consider a large collection of induced subgraphs of G_N obtained by Ramsey-type colorability properties. Specifically, coloring the points of the N-gon red and blue alternatingly, we consider only colorful triangulations, namely triangulations in which every triangle has points in both colors, i.e., monochromatic triangles are forbidden. The resulting induced subgraph of G_N on colorful triangulations is denoted by F_N. We prove that F_N has a Hamilton cycle for all N >= 8, resolving a problem raised by Sagan, i.e., all colorful triangulations on N points can be listed so that any two cyclically consecutive triangulations differ in a flip. In fact, we prove that for an arbitrary fixed coloring pattern of the N points with at least 10 changes of color, the resulting subgraph of G_N on colorful triangulations (for that coloring pattern) admits a Hamilton cycle. We also provide an efficient algorithm for computing a Hamilton path in F_N that runs in time O(1) on average per generated node. This algorithm is based on a new and algorithmic construction of a tree rotation Gray code for listing all n-vertex k-ary trees that runs in time O(k) on average per generated tree.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA22-15272S" target="_blank" >GA22-15272S: Principles of combinatorial generation</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Leibniz International Proceedings in Informatics, LIPIcs
ISBN
978-3-95977-343-0
ISSN
1868-8969
e-ISSN
1868-8969
Number of pages
20
Pages from-to
1-20
Publisher name
Schloss Dagstuhl, Leibniz-Zentrum für Informatik
Place of publication
Wadern
Event location
Vienna, Austria
Event date
Sep 18, 2024
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—