Related papers: Polynomial invariants of graphs on surfaces

We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…

In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the…

Analyzing embedded simplicial complexes, such as triangular meshes and graphs, is an important problem in many fields. We propose a new approach for analyzing embedded simplicial complexes in a subdivision-invariant and isometry-invariant…

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…

Using the diagrammatic approach to integrals over Gaussian random matrices, we find a representation for polynomial Lie group integrals as infinite sums over certain maps on surfaces. The maps involved satisfy a specific condition: they…

The aim of the paper is to clarify the nature of combinatorial structures associated with maps on closed compact surfaces. We prove that maps give rise to Lagrangian matroids representable in a setting provided by cohomology of the surface…

In this note we introduce a family of polynomials on a matroid derived from chain Tutte polynomials which generalize the classic and ubiquitous characteristic polynomial. We show that the coefficients of these polynomials alternate and…

Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…

Let S be an immersed horizontal surface in a 3-dimensional graph manifold. We show that the fundamental group of the surface S is quadratically distorted whenever the surface is virtually embedded (i.e., separable) and is exponentially…

A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The first author recently showed that the…

Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…

Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…

We study some graphs associated to a surface, called k-multicurve graphs, which interpolate between the curve complex and the pants graph. Our main result is that, under certain conditions, simplicial embeddings between multicurve graphs…

We prove a surface embedding theorem for 4-manifolds with good fundamental group in the presence of dual spheres, with no restriction on the normal bundles. The new obstruction is a Kervaire-Milnor invariant for surfaces and we give a…

We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that…

In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…

In this paper, we consider multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomials is defined in terms of a deletion-contraction-extraction recurrence, previously…

Tittmann, Averbouch and Makowsky [P. Tittmann, I. Averbouch, J.A. Makowsky, The enumeration of vertex induced subgraphs with respect to the number of components, European Journal of Combinatorics, 32 (2011) 954-974], introduced the subgraph…