Related papers: Extension to the Beraha-Kahane-Weiss Theorem with …
We study the chromatic polynomials (= zero-temperature antiferromagnetic Potts-model partition functions) P_G(q) for m \times n rectangular subsets of the square lattice, with m \le 8 (free or periodic transverse boundary conditions) and n…
Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…
In this paper we present theorems and applications of Wallis theorem related to trigonometric integrals.
We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial…
The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the…
In this article, we investigate polynomial generalizations of the van der Waerden theorem with a focus on largeness properties of recurrence patterns. We prove an $IP_r^\star$-strengthened version of the polynomial van der Waerden theorem,…
This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…
By the construction of suitable graphs and the determination of their chromatic polynomials, we resolve two open questions concerning real chromatic roots. First we exhibit graphs for which the Beraha number $B_{10} = (5 + \sqrt{5})/2$ is a…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
The Riemann-Roch theorem is of utmost importance in the algebraic geometric theory of compact Riemann surfaces. It tells us how many linearly independent meromorphic functions there are having certain restrictions on their poles. The aim of…
In this work, we consider an extension of graphical models to random graphs, trees, and other objects. To do this, many fundamental concepts for multivariate random variables (e.g., marginal variables, Gibbs distribution, Markov properties)…
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$…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
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…
Let $G = (V,E)$ be a finite, simple, connected graph with chromatic polynomial $P_G(q)$. Sokal \cite{sokal} proved that the roots of the chromatic polynomial of $G$ are bounded in absolute value by $KD$ where, $D$ is the maximum degree of…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollob\'as-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…