English

Planar ternary graphs, flag spheres, and Delannoy polynomials

Combinatorics 2025-09-29 v1

Abstract

In 2022 Kim showed when a graph GG is ternary (without induced cycles of length divisible by three), its independence complex Ind(G)\text{Ind}(G) is either contractible or homotopy equivalent to a sphere. In this paper, we show that when Ind(G)\text{Ind}(G) is homotopy equivalent to a sphere of dimension dimInd(G)\dim \text{Ind}(G), the complex is Gorenstein. Equivalently, GG is a 11-well-covered graph. This answers a question by Faridi and Holleben. We then focus on the independence complexes of Gorenstein planar ternary graphs. We prove that they are boundaries of vertex decomposable simplicial polytopes. We show that the transformations among these flag spheres using edge subdivisions and contractions can be modeled by the Hasse diagram of the partition refinement poset. In addition, their hh-polynomials are products of Delannoy polynomials and thus real-rooted. Finally, we demonstrate a way to construct nonplanar Gorenstein (11-well-covered) ternary graphs from planar ones.

Keywords

Cite

@article{arxiv.2509.21705,
  title  = {Planar ternary graphs, flag spheres, and Delannoy polynomials},
  author = {Margaret Bayer and Richard Danner and Thiago Holleben and Marie Kramer and Yirong Yang},
  journal= {arXiv preprint arXiv:2509.21705},
  year   = {2025}
}

Comments

Comments are welcome

R2 v1 2026-07-01T05:57:28.369Z