Intersection Graphs of Maximal Sub-polygons of $k$-Lizards

TL;DR

This paper introduces $k$-maximal sub-polygon graphs ($k$-MSP graphs), characterizes their structure for various graph types, and constructs examples demonstrating their diverse intersection properties.

Contribution

It defines $k$-MSP graphs, characterizes which graphs are included, and provides constructions showing the differences between $k$-MSP graphs for different $k$.

Findings

All complete graphs are $k$-MSP for all $k>1

Trees are $2$-MSP and $k$-MSP iff they are caterpillars for $k>2

Cycles of length greater than 3 are not $k$-MSP for $k>1

Abstract

We introduce $k$-maximal sub-polygon graphs ($k$-MSP graphs), the intersection graphs of maximal polygons contained in a polygon with sides parallel to a regular $2k$-gon. We prove that all complete graphs are $k$-MSP graphs for all $k>1$; trees are $2$-MSP graphs; trees are $k$-MSP graphs for $k>2$ if and only if they're caterpillars; and $n$-cycles are not $k$-MSP graphs for $n>3$ and $k>1$. We derive bounds for which $j$-cycles appear as induced subgraphs of $k$-MSP graphs. As our main result, we construct examples of graphs which are $k$-MSP graphs and not $j$-MSP graphs for all $k>1$, $j>1$, $k \neq j$.