Locally chordal graphs
Abstract
In this paper we study locally chordal graphs, i.e. graphs where every small-radius ball is chordal. We prove four characterizations of locally chordal graphs. Two are counterparts of the classic descriptions of chordal graphs via induced subgraphs and via minimal separators. For the latter, we rely on the local separators introduced in [CJKK25]. Another characterization is via the local covering, which was introduced in [DJKK22] to study local-global characteristics of graphs using coverings from topology. Our final characterization of locally chordal graphs is in terms of their binary cycle spaces. This gives a new characterization of chordal graphs as wheel-free graphs whose binary cycle space is generated by triangles. Together, these results demonstrate the potential of local-global tools to uncover rich new properties. Our results in this paper also form the basis of our local-global analysis of locally chordal graphs [AKb], where we develop a local-global perspective into structural characterizations.
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.