相关论文: Symmetric function generalizations of graph polyno…

Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…

A survey is given on mathematical structures which emerge in multi-loop Feynman diagrams. These are multiply nested sums, and, associated to them by an inverse Mellin transform, specific iterated integrals. Both classes lead to sets of…

In 1984, a simple and useful univalence criterion for harmonic functions was given by Clunie and Sheil-Small, which is usually called the shear construction. However, the application of this theorem is limited to the planar harmonic…

The Tutte polynomial is a fundamental invariant of graphs. In this article, we define and study a generalization of the Tutte polynomial for directed graphs, that we name B-polynomial. The B-polynomial has three variables, but when…

We look for graph polynomials which satisfy recurrence relations on three kinds of edge elimination: edge deletion, edge contraction and deletion of edges together with their end points. Like in the case of deletion and contraction only (W.…

We describe a way to decompose the chromatic symmetric function as a positive sum of smaller pieces. We show that these pieces are $e$-positive for cycles. Then we prove that attaching a cycle to a graph preserves the $e$-positivity of…

Sazdanovic and Yip defined a categorification of Stanley's chromatic function called the chromatic symmetric homology. In this paper we prove that (as conjectured by Chandler, Sazdanovic, Stella and Yip), if a graph $G$ is non-planar, then…

We find families of simplicial complexes where the simplicial chromatic polynomials defined by Cooper--de Silva--Sazdanovic \cite{CdSS} are Hilbert series of Stanley--Reisner rings of auxiliary simplicial complexes. As a result, such…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

The operation of twinning a graph at a vertex was introduced by Foley, Ho\`ang, and Merkel (2019), who conjectured that twinning preserves $e$-positivity of the chromatic symmetric function. A counterexample to this conjecture was given by…

Let $G$ be a finite group and $\chi: G \rightarrow \mathbb{C}$ a class function. Let $H = (V,E)$ be a directed graph with for each vertex a cyclic order of the edges incident to it. The cyclic orders give a collection $F$ of faces of $H$.…

DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been widely studied in recent years after its introduction by Dvo\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an…

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…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

In a 1995 paper Richard Stanley defined $X_G$, the symmetric chromatic polynomial of a Graph $G=(V,E)$. He then conjectured that $X_G$ distinguishes trees; a conjecture which still remains open. $X_G$ can be represented as a certain…

Chen's iterated integrals may be generalized by interpolation of functions of the positive integer number of times which particular forms are iterated in integrals along specific paths, to certain complex values. These generalized iterated…

For each nonnegative integer $i$, let $a_i$ be the number of $i$-subsets of $V(G)$ that induce an acyclic subgraph of a given graph $G$. We define $A(G,x) = \sum_{i \geq 0} a_i x^i$ (the generating function for $a_i$) to be the acyclic…

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

We present a review of the most important results in the theory of symmetric functions in superspace (or symmetric superpolynomials), summarizing all principal contributions since its introduction in 2001 in the context of the…

Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…