相关论文: Weighted enumeration of spanning subgraphs with de…

Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…

An analytic classification of generic anti-polynomial vector fields $\dot z = \overline{P(z)}$ is given in term of a topological and an analytic invariants. The number of generic strata in the parameter space is counted for each degree of…

We study criteria which ensure that Gibbs states (often also called generalized vacuum states) on distance-regular graphs are positive. Our main criterion assumes that the graph can be embedded into a growing family of distance-regular…

Let $p$ be a polynomial in non-commutative variables $x_1,x_2,\ldots,x_n$ with constant term zero over an algebraically closed field $K$. The object of study in this paper is the image of this kind of polynomial over the algebra of upper…

Let $G$ be a connected graph on $n$ vertices with adjacency matrix $A_G$. Associated to $G$ is a polynomial $d_G(x_1,\dots, x_n)$ of degree $n$ in $n$ variables, obtained as the determinant of the matrix $M_G(x_1,\dots,x_n)$, where…

We show that for each single crossing graph $H$, a polynomially bounded weight function for all $H$-minor free graphs $G$ can be constructed in Logspace such that it gives nonzero weights to all the cycles in $G$. This class of graphs…

It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…

It is well known that the coefficients of the matching polynomial are unimodal. Unimodality of the coefficients (or their absolute values) of other graph polynomials have been studied as well. One way to prove unimodality is to prove…

For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when…

We describe a generalization of GKM theory for actions of arbitrary compact connected Lie groups. To an action satisfying the non-abelian GKM conditions we attach a graph encoding the structure of the non-abelian 1-skeleton, i.e., the…

We study theorems giving sufficient conditions on the vertex degrees of a graph $G$ to guarantee $G$ is $t$-tough. We first give a best monotone theorem when $t\ge1$, but then show that for any integer $k\ge1$, a best monotone theorem for…

Let $G$ be a finite simple graph and $B \subseteq V(G)$. We study the \emph{$B$-restricted clique polynomial} $C_B(G;x)$, including its weighted version allowing vertex multiplicities, as a versatile tool to capture structural properties of…

Let $G$ be a graph with an adjacent matrix $A(G)$. The multiplicity of an arbitrary eigenvalue $\lambda$ of $A(G)$ is denoted by $m_\lambda(G)$. In \cite{Wong}, the author apply the Pater-Wiener Theorem to prove that if the diameter of $T$…

We confirm a conjecture of Gartland and Lokshtanov [arXiv:2007.08761]: if for a hereditary graph class $\mathcal{G}$ there exists a constant $k$ such that no member of $\mathcal{G}$ contains a $k$-creature as an induced subgraph or a…

An equitable $k$-coloring of a graph is a proper $k$-coloring where the sizes of any two different color classes differ by at most one. In 1973, Meyer conjectured that every connected graph $G$ has an equitable $k$-coloring for some $k\leq…

We give counterexamples to the Brown-Colbourn conjecture on reliability polynomials, in both its univariate and multivariate forms. The multivariate Brown-Colbourn conjecture is false already for the complete graph K_4. The univariate…

Let $G_1, \dots, G_k$ and $H$ be vector spaces over a finite field $\mathbb{F}_p$ of prime order. Let $A \subset G_1 \times\dots\times G_k$ be a set of size $\delta |G_1| \cdots |G_k|$. Let a map $\phi \colon A \to H$ be a…

We pose and solve the equivalence problem for subspaces of ${\mathcal P}_n$, the $(n+1)$ dimensional vector space of univariate polynomials of degree $\leq n$. The group of interest is ${\rm SL}_2$ acting by projective transformations on…

To a weighted graph can be associated a bipartite graph planar algebra P. We construct and study the symmetric enveloping inclusion of P. We show that this construction is equivariant with respect to the automorphism group of P. The…

Quantum knot invariants (like colored HOMFLY-PT or Kauffman polynomials) are a distinguished class of non-perturbative topological invariants. Any known way to construct them (via Chern-Simons theory or quantum R-matrix) starts with a…