2025/12/26 by Simon Y. M. Gong, David G. L. Wang, Gong, Simon Y. M. +3
Computer Science · #Interconnection Networks and Systems #Advanced Graph Theory Research #Computational Geometry and Mesh Generation
paper · doi:10.48550/arxiv.2512.21864
In this paper, we identify a new family of e-positive graphs, called the trinacria graphs T(b+2)b2, thereby providing a partial answer to Stanley's question on which graphs are e-positive. The trinacria graph Tabc is the graph on a+b+c+3 vertices obtained by attaching paths Pa, Pb and~Pc to the vertices of a triangle, respectively. Our proof relies on several ad hoc combinatorial ideas, and employs divide-and-conquer techniques, charging arguments, and progressive repair methods.