Identities of the multi-variate independence polynomials from heaps theory

DOI10.1007/s12044-024-00786-2zbMATH Open1542.05081MaRDI QIDQ6566131

Deniz Kus, Kartik Singh, R. Venkatesh

Publication date: 3 July 2024

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

heapsindependence polynomial of a graphCartier-Foata monoids

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The roots of the independence polynomial of a clawfree graph
• Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
• Clique polynomials and independent set polynomials of graphs
• Root multiplicities for Borcherds algebras and graph coloring
• On trees with real-rooted independence polynomial
• Generalizations of the matching polynomial to the multivariate independence polynomial
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Combinatorial problems of commutation and rearrangements
• Matchings and walks in graphs
• Christoffel–Darboux Type Identities for the Independence Polynomial

This page was built for publication: Identities of the multi-variate independence polynomials from heaps theory