Canonical tree-decompositions of chordal graphs
Abstract
We show that a locally finite, connected graph G is r-locally chordal (that is, its r/2-balls are chordal) if and only if the unique canonical graph-decomposition Hr(G) of G displaying its r-global structure is into cliques. Our proof relies on a canonical version of Halin's characterization of chordal locally finite graphs as those that admit a tree-decomposition into cliques: We show that such tree-decompositions can be chosen to be canonical, that is, so that they are invariant under all the graph's automorphisms.
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.