Chromatic polynomials of graphs from Kac-Moody algebras
From MaRDI portal
Publication:2354060
DOI10.1007/s10801-014-0570-1zbMath1316.05068arXiv1303.1148OpenAlexW2118182801MaRDI QIDQ2354060
Sankaran Viswanath, R. Venkatesh
Publication date: 10 July 2015
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.1148
Graph polynomials (05C31) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10) Kac-Moody (super)algebras; extended affine Lie algebras; toroidal Lie algebras (17B67) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Related Items
Generalised chromatic polynomials of graphs from heaps of pieces, A study on free roots of Borcherds-Kac-Moody Lie superalgebras, Root multiplicities for Borcherds algebras and graph coloring, Chromatic symmetric function of graphs from Borcherds algebras
Cites Work
- Unnamed Item
- Unnamed Item
- The enumeration of Coxeter elements
- Conjugacy of Coxeter elements.
- Unique factorization of tensor products for Kac-Moody algebras
- A symmetric function generalization of the chromatic polynomial of a graph
- Acyclic orientations of graphs
- On enumeration of conjugacy classes of Coxeter elements
- An introduction to chromatic polynomials
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Conjugacy relation on Coxeter elements