Related papers: An eigenvalue bound for the fractional chromatic n…
In this article we give bounds for the eigenvalues of a matrix, which can be seen as a common generalization of meet and join matrices and therefore also as a generalization of both GCD and LCM matrices. Although there are some results…
The chromatic threshold of a graph $H$ is the minimum-degree density above which every $H$-free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs $H_1$ and $H_2$, we ask for the minimum-degree density…
We develop an improved bound for the chromatic number of graphs of maximum degree $\Delta$ under the assumption that the number of edges spanning any neighbourhood is at most $(1-\sigma)\binom{\Delta}{2}$ for some fixed $0<\sigma<1$. The…
We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus confirming a conjecture of Heckman and Thomas [A new proof of the independence ratio of triangle-free cubic graphs. Discrete Math. 233…
We apply the bound on independence number via Lov{\'a}sz theta function to eventown problem and its generalizations over $\mathbb{Z}_n$.
Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…
For bound states of atoms and molecules of $N$ electrons we consider the corresponding $K$-particle reduced density matrices, $\Gamma^{(K)}$, for $1 \le K \le N-1$. Previously, eigenvalue bounds were obtained in the case of $K=1$ and…
This paper describes an improvement in the upper bound for the magnitude of a coefficient of a term in the chromatic polynomial of a general graph. If $a_r$ is the coefficient of the $q^r$ term in the chromatic polynomial $P(G,q)$, where…
The lower bound for the chromatic number of the Euclidean space of dimension 8 is increased to 25.
We investigate the effect of the well-known Mycielski construction on the Shannon capacity of graphs and on one of its most prominent upper bounds, the (complementary) Lov\'asz theta number. We prove that if the Shannon capacity of a graph,…
We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erd\H{o}s-R\'{e}nyi graphs. We investigate…
Two celebrated extensions of the classical Helly's theorem are the fractional Helly theorem and the colorful Helly theorem. Bulavka, Goodarzi, and Tancer recently established the optimal bound for the unified generalization of the…
In this article, we investigate some isoperimetric-type inequalities related to the first eigenvalue of the fractional composite membrane problem. First, we establish an analogue of the renowned Faber-Krahn inequality for the fractional…
We continue the study of a non self-adjoint fractional three-term Sturm-Liouville boundary value problem (with a potential term) formed by the composition of a left Caputo and left-Riemann-Liouville fractional integral under {\it Dirichlet…
A fractional coloring of a signed graph $(G, {\sigma})$ is an assignment of nonnegative weights to the balanced sets (sets which do not induce a negative cycle) such that each vertex has an accumulated weight of at least 1. The minimum…
In this paper we analyze possible extensions of the classical Steklov eigenvalue problem to the fractional setting. In particular, we find a nonlocal eigenvalue problem of fractional type that approximate, when taking a suitable limit, the…
To provide mathematically rigorous eigenvalue bounds for the Steklov eigenvalue problem, an enhanced version of the eigenvalue estimation algorithm developed by the third author is proposed, which removes the requirements of the positive…
We prove the attainability of the best constant in the fractional Hardy--Sobolev inequality with boundary singularity for the Spectral Dirichlet Laplacian. The main assumption is the average concavity of the boundary at the origin.
We obtain several new upper bounds of the odd graceful chromatic number of a graph $G$, which must be bipartite. Some of our bounds depend only on the number of the vertices of $G$ or the chromatic number of some graphs related to the…
The chromatic number $\chi(G)$ of a graph $G$ is defined as the minimum number of colours required for a vertex colouring where no two adjacent vertices are coloured the same. The chromatic number of the dense random graph $G \sim G(n,p)$…