Saved in:
Bibliographic Details
Main Author: Gong, Charles
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2410.19078
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908840055799808
author Gong, Charles
author_facet Gong, Charles
contents Let $G$ be a plane graph and let $C$ be a cycle in $G$. For each finite face of $G$, count the number of edges of $C$ the face contains. We call this the Slitherlink signature of $C$. The symmetric difference $A$ of two cycles with the same signature is totally even, meaning every vertex is incident to an even number of edges in $A$ and every face contains an even number of edges in $A$. In this paper, we completely characterize totally even subsets in the triangular grid, and count the number of edges in any totally even subset of the triangular grid. We also show that the size of the symmetric difference of two cycles with the same signature in the triangular grid is divisible by $12$; this is best possible since 12 is the greatest common divisor of all the sizes of the symmetric difference between two cycles with the same signature in a triangular grid.
format Preprint
id arxiv_https___arxiv_org_abs_2410_19078
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Slitherlink on Triangular Grids
Gong, Charles
Combinatorics
Let $G$ be a plane graph and let $C$ be a cycle in $G$. For each finite face of $G$, count the number of edges of $C$ the face contains. We call this the Slitherlink signature of $C$. The symmetric difference $A$ of two cycles with the same signature is totally even, meaning every vertex is incident to an even number of edges in $A$ and every face contains an even number of edges in $A$. In this paper, we completely characterize totally even subsets in the triangular grid, and count the number of edges in any totally even subset of the triangular grid. We also show that the size of the symmetric difference of two cycles with the same signature in the triangular grid is divisible by $12$; this is best possible since 12 is the greatest common divisor of all the sizes of the symmetric difference between two cycles with the same signature in a triangular grid.
title Slitherlink on Triangular Grids
topic Combinatorics
url https://arxiv.org/abs/2410.19078