Related papers: Topological Graph Polynomials in Colored Group Fie…
Starting from a given topological invariant, we argue that it is possible to construct a topological field theory with a finite number of Feynman diagrams and an amplitude of gauge invariant objects that is a function of that invariant.…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
In the paper we give a lower bound for the number of vertices of a given graph using its chromatic number. We find the graphs for which this bound is exact. The results are applied in the theory of Foklman numbers.
We introduce and study the notion of a dual Feynman transform of a modular operad. This generalizes and gives a conceptual explanation of Kontsevich's dual construction producing graph cohomology classes from a contractible differential…
In 2006, Collins and Trenk obtained a general sharp upper bound for the distinguishing chromatic number of a connected graph. Inspired by Catlin's combinatorial techniques from 1978, we establish improved upper bounds for classes of…
We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$. Our first contribution is an…
In this paper, we introduce the concept of the weighted (harmonic) chromatic polynomials of graphs and discuss some of its properties. We also present the notion of the weighted (harmonic) Tutte--Grothendieck polynomials of graphs and give…
The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions. Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are…
We provide recipe theorems for the Bollob\`as and Riordan polynomial $\mathcal{R}$ defined on classes of ribbon graphs with half-edges introduced in arXiv:1310.3708[math.GT]. We also define a generalized transition polynomial $Q$ on this…
We take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
We introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by…
The $2$-decomposition for ribbon graphs was introduced in [Annals of Combinatorics 15 (2011), pp 675-706]. We extend this result to half-edged ribbon graphs and to rank $D$-weakly colored graphs [SIGMA 12 (2016), 030], generalizing…
We present a general construction of all correlation functions of a two-dimensional rational conformal field theory, for an arbitrary number of bulk and boundary fields and arbitrary topologies. The correlators are expressed in terms of…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…
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…
We give upper bounds, linear in rank, to the topological dimensions of the Gromov boundaries of the intersection graph, the free factor graph and the cyclic splitting graph of a finitely generated free group.
We consider a graph polynomial \xi(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Dohmen, Poenitz…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…