Related papers: Colored graphs, Gaussian integrals and stable grap…
We present a unified framework of combinatorial descriptions, and the analogous asymptotic growth of the coefficients of two general families of functions related to integer partitions. In particular, we resolve several conjectures and…
We consider the problem of extending partial edge colorings of cartesian products of graphs. More specifically, we suggest the following Evans-type conjecture: If $G$ is a graph where every precoloring of at most $k$ precolored edges can be…
Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles…
Given a finite set of $2$-edge-coloured graphs $\mathcal F$ and a hereditary property of graphs $\mathcal{P}$, we say that $\mathcal F$ expresses $\mathcal{P}$ if a graph $G$ has the property $\mathcal{P}$ if and only if it admits a…
We exhibit non-switching-isomorphic signed graphs that share a common underlying graph and common chromatic polynomials, thereby answering a question posed by Zaslavsky. For various joins of all-positive or all-negative signed complete…
We construct the general permutation invariant Gaussian 2-matrix model for matrices of arbitrary size $D$. The parameters of the model are given in terms of variables defined using the representation theory of the symmetric group $S_D$. A…
It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…
We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of \emph{component coloring of graphs}. Given a graph, the problem is to color the vertices using minimum number of colors so that…
A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…
In this paper we analyze the open Feynman graphs of the Colored Group Field Theory introduced in [arXiv:0907.2582]. We define the boundary graph $\cG_{\partial}$ of an open graph $\cG$ and prove it is a cellular complex. Using this…
We show that every Borel graph $G$ of subexponential growth has a Borel proper edge-coloring with $\Delta(G) + 1$ colors. We deduce this from a stronger result, namely that an $n$-vertex (finite) graph $G$ of subexponential growth can be…
We study generating series of torus integrals that contain all so-called modular graph forms relevant for massless one-loop closed-string amplitudes. By analysing the differential equation of the generating series we construct a solution…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
The Additive Coloring Problem is a variation of the Coloring Problem where labels of $\{1,\ldots,k\}$ are assigned to the vertices of a graph $G$ so that the sum of labels over the neighborhood of each vertex is a proper coloring of $G$.…
We develop a general mathematical framework to analyze scaling regimes and derive explicit analytic solutions for gradient flow (GF) in large learning problems. Our key innovation is a formal power series expansion of the loss evolution,…
A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is adjacent to all other color classes. The b-chromatic number of a graph G, denoted by \chi_b(G), is the maximum number t such that G admits a…
We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…
The results of part I (hep-ph/9612284) are used to obtain full asymptotic expansions of Feynman diagrams renormalized within the MS-scheme in the regimes when some of the masses and external momenta are large with respect to the others. The…