An Isoperimetric Inequality and Pursuit-Evasion Games on Triangular Grid Graphs
Abstract
In this paper, we prove an isoperimetric inequality for the triangular grid graph which was conjectured by Adams, Gibson, and Pfaffinger, using the compression technique of Bollob\'as and Leader. Moreover, we apply the isoperimetric inequality to the Zero-Visibility Search game and Lions and Contamination game in order to obtain lower bounds for the inspection number and lion number respectively. We also provide searching strategies to prove upper bounds for both the inspection number and lion number.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.