Related papers: Universal graph series, chromatic functions, and t…
In this work we produce a framework for constructing universal function approximators on graph isomorphism classes. We prove how this framework comes with a collection of theoretically desirable properties and enables novel analysis. We…
Universal cycles, such as De Bruijn cycles, are cyclic sequences of symbols that represent every combinatorial object from some family exactly once as a consecutive subsequence. Graph universal cycles are a graph analogue of universal…
We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…
In this note we obtain numerous new bases for the algebra of symmetric functions whose generators are chromatic symmetric functions. More precisely, if $\{ G_ k \}_{k\geq 1}$ is a set of connected graphs such that $G_k$ has $k$ vertices for…
A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…
Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…
We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
Let G = (V, E) be a finite simple connected graph. We say a graph G realizes a code of the type 0^s_1 1^t_1 0^s_2 1^t_2 ... 0^s_k1^t_k if and only if G can obtained from the code by some rule. Some classes of graphs such as threshold and…
We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…
A MacMahon symmetric function is an invariant of the diagonal action of the symmetric group on power series in multiple alphabets of variables. We introduce an analogue of the chromatic symmetric function for vertex-weighted graphs, taking…
We construct the meromorphic functions invariant under the action of the sense-preserving wallpaper groups on the complex plane. We discuss possible generalisa-tions of this to the general wallpaper groups. This provides the answer to a…
In this paper we consider the following three coloring concepts for digraphs. First of all, the generalized coloring concept, in which the same colored vertices of a digraph induce a subdigraph that satisfies a given digraph property.…
We show how to define invariants of graphs related to quantum $\mathfrak{sl}(2)$ when the graph has more then one connected component and components are colored by blocks of representations with zero quantum dimensions.
We define the $d$-defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including trees, complete bipartite graphs, complete graphs, and…
We generalize the notion of an inverse sequence of graph covers from the zero-dimensional dynamical systems to any dynamical system.
We define an infinite graded graph of ordered pairs and a~canonical action of the group $\mathbb{Z}$ (the adic action) and of the infinite sum of groups of order two~$\mathcal{D}=\sum_1^{\infty} \mathbb{Z}/2\mathbb{Z}$ on the path space of…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
Let $\mathcal{C} = \{c_1,c_2, c_3, \ldots,c_k\}$ be a certain type of proper $k$-colouring of a given graph $G$ and $\theta(c_i)$ denote the number of times a particular colour $c_i$ is assigned to the vertices of $G$. Then, the colouring…