Related papers: Interpreting the (signed) chromatic polynomial coe…
We consider adaptive estimation and statistical inference for high-dimensional graph-based linear models. In our model, the coordinates of regression coefficients correspond to an underlying undirected graph. Furthermore, the given graph…
A famous and wide-open problem, going back to at least the early 1970's, concerns the classification of chromatic polynomials of graphs. Toward this classification problem, one may ask for necessary inequalities among the coefficients of a…
We generalize the recently discovered planar decomposition (Kauffman bracket) for the HOMFLY polynomials of bipartite knot/link diagrams to (anti)symmetrically colored HOMFLY polynomials. Cabling destroys planarity, but it is restored after…
We study the connections between link invariants, the chromatic polynomial, geometric representations of models of statistical mechanics, and their common underlying algebraic structure. We establish a relation between several algebras and…
We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the…
In "Faces of a Hyperplane Arrangement Enumerated by Ideal Dimension, with Applications to Plane, Plaids, and Shi," Zaslavsky showed how to compute the number $r_\ell(\mathcal{A})$ of regions of a real hyperplane arrangement $\mathcal{A}$…
We prove that the coindex of the box complex $\mathrm{B}(H)$ of a graph $H$ can be measured by the generalised Mycielski graphs which admit a homomorphism to it. As a consequence, we exhibit for every graph $H$ a system of linear equations…
We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…
Let H be a tree. It was proved by Rodl that graphs that do not contain H as an induced subgraph, and do not contain the complete bipartite graph $K_{t,t}$ as a subgraph, have bounded chromatic number. Kierstead and Penrice strengthened…
The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov…
This paper characterizes the values of partial regression coefficients, defined as projection coefficients onto the space spanned by explanatory variables, for random variables generated by linear structural equation models using graphical…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
The orbital bivariate chromatic polynomial, introduced in this article, counts the number of ways to color the vertices of a graph with $\lambda$ colors such that adjacent vertices either receive distinct colors from a set of $\lambda$…
Some of the most classically relevant Hyperplane arrangements are the Braid Arrangements $B_n$ and their associated compliment spaces $\mathcal{F}_n$. In their recent work, Tsilevich, Vershik, and Yuzvinsky construct what they refer to as…
In 1977, Yu. V. Matiyasevich proposed a formula expressing the chromatic polynomial of an arbitrary graph as a linear combination of flow polynomials of subgraphs of the original graph. In this paper, we prove that this representation is a…
In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.
We describe a multivariable polynomial invariant for certain class of non isolated hypersurface singularities generalizing the characteristic polynomial on monodromy. The starting point is an extension of a theorem due to Le Dung Trang and…
We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…
The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…
In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of certain modified graph polynomials and also discuss…