Related papers: Christoffel-Darboux type identities for independen…

An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…

It is known from the work of Shearer (1985) (and also Scott and Sokal (2005)) that the independence polynomial $Z_G(\lambda)$ of a graph $G$ of maximum degree at most $d+1$ does not vanish provided that $\vert{\lambda}\vert \leq…

Let $X$ be a locally compact Abelian group, $Y$ be its character group. Following A. Kagan and G. Sz\'ekely we introduce a notion of $Q$-independence for random variables with values in $X$. We prove group analogues of the Cram\'er,…

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…

In this note we consider the independent domination polynomial problem along with their unimodal and log-concave properties which were earlier studied by G\"ursoy, \"Ulker and G\"ursoy (Soft Comp. 2022). We show that the independent…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size. Two graphs are said to be \textit{independence equivalent} if they have equivalent independence polynomials. We extend…

We give a presentation of refined (dual) canonical Grothendieck polynomials and their skew versions using free-fermions. Using this, we derive a number of identities, including the skew Cauchy identities, branching rules, expansion…

We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from…

For finite connected graphs $\Gamma$ and $G$, with $\Gamma$ admitting a free involution $\tau$, we characterize the based homotopy classes $\alpha\in[\Gamma,G]$ for which the Borsuk-Ulam property holds in the sense of Gon\c{c}alves, Guaschi…

As introduced by Gutman and Harary, the independence polynomial of a graph serves as the generating polynomial of its independent sets. In 1987, Alavi, Malde, Schwenk and Erd\H{o}s conjectured that the independence polynomials of all trees…

If for any k the k-th coefficient of a polynomial I(G;x)is equal to the number of stable sets of cardinality k in graph G, then it is called the independence polynomial of G (Gutman and Harary, 1983). A graph G is very well-covered…

In this paper, we prove that on any contact manifold, there exists an arbitrary C^{\infty}-small contactomorphism which does not admit a square root. In particular, there exists an arbitrary C^{\infty}-small contactomorphism which is not…

We obtain new lower bounds for the independence number of $K_r$-free graphs and linear $k$-uniform hypergraphs in terms of the degree sequence. This answers some old questions raised by Caro and Tuza \cite{CT91}. Our proof technique is an…

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 introduce and study families of squarefree monomial ideals called clique ideals and independence ideals that can be associated to a finite graph. A family of clique ideals with linear resolutions has been characterized.…

A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.

We study multivariable Christoffel-Darboux kernels, which may be viewed as reproducing kernels for antisymmetric orthogonal polynomials, and also as correlation functions for products of characteristic polynomials of random Hermitian…

In an attempt to understanding the complexity of the independent set problem, Chv{\'a}tal defined t-perfect graphs. While a full characterization of this class is still at large, progress has been achieved for claw-free graphs [Bruhn and…

We introduce the notion of Kravchuk derivations of the polynomial algebra. We prove that any element of the kernel of the derivation gives a polynomial identity satisfied by the Kravchuk polynomials. Also, we prove that any kernel element…

Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…