Anthony Vuolo | Searcharxiv

arXiv2026

On B-Colorings in Planar Graphs

Gy\'arf\'as and S\'ark\"ozy [Studia Sci. Math. Hungar., 2023] defined a B-coloring of a graph to be a proper coloring of the edge set in which any $C_4$ is totally multicolored. Let $q_B(G)$ denote the minimum number of colors sufficient for a B-coloring of a graph $G$. In this paper, we prove that any planar graph $G$ with $\Delta=\Delta(G)$ and $\Delta_2=\Delta_2(G)$ has $q_B(G)\leq\Delta+\max\{\Delta_2,38\}$, refining a bound by Kong, Wang, and Zheng [J. Graph Theory, 2026].

math.CO↗

arXiv2024

Nonexistence of a class of $T_N$ configurations for a hyperbolic system with one entropy

In Kirchheim, M\"{u}ller and \v{S}ver\'{a}k [Studying nonlinear PDE by geometry in matrix space. Geometric analysis and nonlinear partial differential equations, 2003], the authors proposed the program to use the differential inclusion approach to study entropy solutions for systems of conservation laws. In particular, they raised questions concerning the local structure of the rank-one convex hull of a set $K_a\subset\mathbb{R}^{3\times 2}$, which arises from the differential inclusion formulation of a classical $2\times 2$ system of conservation laws (the $p$-system) coupled with one entropy. Recently, this question has been studied extensively by showing that the set $K_a$ does not contain the so-called $T_N$ configurations for $N=4$ and $N=5$. In this paper, we continue this program by showing that the set $K_a$ does not contain a class of three-dimensional $T_N$ configurations, as well as two-dimensional $T_N$ configurations for general $N$.

math.AP↗