On the characterization of chordal graphs using Horn hypergeometric series

Abstract

Radchenko and Villegas characterized the chordal graphs by the inverse of their independence polynomials being Horn hypergeometric series in Radchenko et al. in 2021. In this paper, we reprove their result using some elementary combinatorial methods. Our proof is different from their proof, and it is based on the connection between the inverse of the multi-variate independence polynomials and the multi-colored chromatic polynomials of graphs, established by Arunkumar et al. in 2018.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…