相关论文: Colorings and flows on CW complexes, Tutte quasi-p…

The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…

It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollob\'as and Riordan, we introduce a…

The reconstruction conjecture has remained open for simple undirected graphs since it was suggested in 1941 by Kelly and Ulam. In an attempt to prove the conjecture, many graph invariants have been shown to be reconstructible from the…

This is a chapter destined for the book "Handbook of the Tutte Polynomial". The chapter is a composite. The first part is a brief introduction to Orlik-Solomon algebras. The second part sketches the theory of evaluative functions on matroid…

We first observe a mysterious similarity between the braid arrangement and the arrangement of all hyperplanes in a vector space over the finite field $\mathbb{F}_q$. These two arrangements are defined by the determinants of the Vandermonde…

In 2004, Karo\'nski, \L uczak and Thomason proposed $1$-$2$-$3$-conjecture: For every nice graph $G$ there is an edge weighting function $ w:E(G)\rightarrow\{1,2,3\} $ such that the induced vertex coloring is proper. After that, the total…

Let $M=(E,\mathcal B)$ be an $\mathbb F_q$-linear matroid; denote by ${\mathcal B}$ the family of its bases, $s(M;\alpha)=\sum_{B\in\mathcal B}\prod_{e \in B} \alpha_e$, where ${\alpha_e\in \mathbb F_q}$. According to the Kontsevich…

The amplitudes of refined Chern-Simons (CS) theory, colored by antisymmetric (or symmetric) representations, conjecturally generate the Lambda^r- (or S^r-) colored triply graded homology of (n,m) torus knots. This paper is devoted to the…

We study an operation in matroid theory that allows one to transition a given matroid into another with more bases via relaxing a \emph{stressed subset}. This framework provides a new combinatorial characterization of the class of split…

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 tensor product $(G_1,G_2)$ of a graph $G_1$ and a pointed graph $G_2$ (containing one distinguished edge) is obtained by identifying each edge of $G_1$ with the distinguished edge of a separate copy of $G_2$, and then removing the…

We prove that the two-variable Tutte polynomial of hypergraphs can be defined via embedding activities. We also prove that embedding activities of hypergraphs yield a Crapo-style decomposition of $\mathbb{Z}^E$, thus generalizing Bernardi's…

We establish the relationship between volumes of flow polytopes associated to signed graphs and the Kostant partition function. A special case of this relationship, namely, when the graphs are signless, has been studied in detail by Baldoni…

Tensor models are used nowadays for implementing a fundamental theory of quantum gravity. We define here a polynomial $\mathcal T$ encoding the supplementary topological information. This polynomial is a natural generalization of the…

We compute an explicit formula for the antipode of the double bialgebra of graphs in terms of totally acyclic partial orientations, using some general results on double bialgebras. In analogy to what was already proven in Hopf-algebraic…

The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…

We study two weighted graph coloring problems, in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given color. We…

A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we…

In this study, we present two results that relate Tutte polynomials. First, we provide new and complete polynomial invariants for graphs. We note that the number of variables of our polynomials is one. Second, let L_1 and L_2 be two…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…