Nguyen~\cite{Nguyen2025} recently proved that every $\{P_5,C_5\}$-free graph $G$ satisfies $\chi(G)\leq \omega(G)^{40}$. Building on his framework, we introduce two refinements, namely a sharper cutset decomposition using the $C_5$-free condition and an improved density-increment argument. These yield a polynomial $\chi$-binding function with exponent $24$, improving the previous bound of $40$.
We prove that the path $P_{11}$ does not admit uniform average mixing under any probability distribution on $\mathbb R$, answering a question of Baptista, Coutinho, and Marques in the negative. The proof is exact: we construct an explicit rational symmetric matrix $Y$ such that $\langle Y,M(t)\rangle_F=1$ for every $t\...
For positive integers $r, m$ and $N$, every $r$-coloring of $\{1, \dots, N\}$ contains a monochromatic solution to $x_1+\dots+x_{m+1}=y_1+\dots+y_m$ provided that $N \ge 3^r (r!)^{1/m}$, which is qualitatively optimal when $m$ is logarithmic in $r$.
Swaroop G. Hegde, Andrew Lott, G. Petridis et al.· 0 citations
Let $H_{27}=\mathrm{UT}_3(\mathbb{F}_3)$ be the nonabelian group of order $27$ and exponent $3$. We prove that $\mathsf{d}(H_{27}\times C_3^r)=2r+6$ for every integer $r\geq0$. The proof combines an affine coefficient identity in the group algebra of an elementary abelian group with a decomposition of the nonorthogonal...
For an $F$-free graph $G$, a non-edge is $F$-saturating if adding it to $G$ creates a copy of $F$. We denote by $f_{p+1}(n,m)$ the minimum number of $K_{p+1}$-saturating non-edges in a $K_{p+1}$-free $n$-vertex graph with $m$ edges. Erd\H{o}s and Tuza conjectured that $f_4\left(n,\mathrm{ex}(n,K_3)+ 1\right)= (1 + o(1)...
Let $B$ denote Bloch's constant. We prove \[ B \ge \frac{\sqrt{3}}{4}+0.0153 = 0.448312701\ldots, \] improving the lower bounds by Chen--Gauthier ($\sqrt{3}/4+2\cdot10^{-4}$) and Xiong ($\sqrt{3}/4+3\cdot10^{-4}$). The proof refines Bonk's method through computer-assisted estimates rigorously verified using interval ar...
For a simple graph $G$ of order $n$, let $\lambda_1(G)\ge \cdots \ge \lambda_n(G)$ denote its adjacency eigenvalues. Hong's problem asks for the optimal upper bound for $\lambda_k(G)$. A recent theorem of Sivashankar gives, for every $k\ge3$, \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1, \] with sharp exam...
Hitesh Kumar, Bojan Mohar, S. A. Mojallal et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
