Related papers: Polynomial Invariants for Arbitrary Rank $D$ Weakl…
There are several different extensions of the Tutte polynomial to graphs embedded in surfaces. To help frame the different options, here we consider the problem of extending the Tutte polynomial to cellularly embedded graphs starting from…
We construct a state model for the two-variable Kauffman polynomial using planar trivalent graphs. We also use this model to obtain a polynomial invariant for a certain type of trivalent graphs embedded in three-dimensional space.
As an extension of positive and almost positive diagrams and links, we study two classes of links we call successively almost positive and weakly successively almost positive links. We prove various properties of polynomial invariants and…
In this paper, we analyze the Bollob\'as and Riordan polynomial $\mathcal{R}$ for ribbon graphs with half-ribbons introduced in [Combinatorics, Probability and Computing 31, 507-549, 2022]. We prove the universality property of a…
We find new properties of the topological transition polynomial of embedded graphs, $Q(G)$. We use these properties to explain the striking similarities between certain evaluations of Bollob\'as and Riordan's ribbon graph polynomial,…
The (univariate) avalanche polynomial of a graph, introduced by Cori, Dartois and Rossin in 2006, captures the distribution of the length of (principal) avalanches in the abelian sandpile model. This polynomial has been used to show that…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…
We introduce a new model of random multigraphs with colored vertices and weighted edges. It is similar to the "inhomogeneous random graph model" of S\"oderberg (2002), extended by Bollob\'as, Janson and Riordan (2007). By means of analytic…
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
The classification of high-dimensional data defined on graphs is particularly difficult when the graph geometry is unknown. We introduce a Haar scattering transform on graphs, which computes invariant signal descriptors. It is implemented…
The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…
We give a short introduction to the theory of twisted Alexander polynomials of a 3--manifold associated to a representation of its fundamental group. We summarize their formal properties and we explain their relationship to twisted…
Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs of girth at least four are 4-list-colourable. In 2022,…
We construct a new polynomial invariant of maps (graphs embedded in a compact surface, orientable or non-orientable), which contains as specializations the Krushkal polynomial, the Bollob\'as--Riordan polynomial, the Las Vergnas polynomial,…
This paper extends the scenario of the Four Color Theorem in the following way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly) embedded into R^d. We investigate lower and upper bounds on the maximum (weak and…
By using Laurent graph polynomials instead of the usual ones, i.e. by allowing negative powers of the variables, we simplify an existing method of determining the Alon-Tarsi numbers of planar graphs.
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…