Mathematics > Combinatorics
[Submitted on 31 Dec 2017]
Title:Blockers for Triangulations of a Convex Polygon and a Geometric Maker-Breaker Game
View PDFAbstract:Let $G$ be a complete convex geometric graph whose vertex set $P$ forms a convex polygon $C$, and let $F$ be a family of subgraphs of $G$. A blocker for $F$ is a set of edges, of smallest possible size, that contains a common edge with every element of $F$. Previous works determined the blockers for various families $F$ of non-crossing subgraphs, including the families of all perfect matchings, all spanning trees, all Hamiltonian paths, etc.
In this paper we present a complete characterization of the family $B$ of blockers for the family $T$ of triangulations of $C$. In particular, we show that $|B|=F_{2n-8}$, where $F_k$ is the $k$'th element in the Fibonacci sequence and $n=|P|$.
We use our characterization to obtain a tight result on a geometric Maker-Breaker game in which the board is the set of diagonals of a convex $n$-gon $C$ and Maker seeks to occupy a triangulation of $C$. Namely, we show that in the $(1:1)$ triangulation game, Maker can ensure a win within $n-3$ moves, and that in the $(1:2)$ triangulation game, Breaker can ensure a win within $n-3$ moves. In particular, the threshold bias for the game is $2$.
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.