Related papers: An Affine Linear Solution for the 2-Face Colorable…
A Star Coloring of a graph G is a proper vertex coloring such that every path on four vertices uses at least three distinct colors. The minimum number of colors required for such a star coloring of G is called star chromatic number, denoted…
We present in detail a simple, exact solution of the anisotropic 2-channel Kondo (2CK) model at its Toulouse point. We reduce the model to a quadratic resonant-level model by generalizing the bosonization-refermionization approach of Emery…
Restricted star colouring is a variant of star colouring introduced to design heuristic algorithms to estimate sparse Hessian matrices. For $k\in\mathbb{N}$, a $k$-restricted star colouring ($k$-rs colouring) of a graph $G$ is a function…
The discharging method is a powerful proof technique, especially for graph coloring problems. Its major downside is that it often requires lengthy case analyses, which are sometimes given to a computer for verification. However, it is much…
This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…
We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let $G$ be a planar triangulation. Then the dual $G^*$ is a cubic…
Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors $\chi$. Each cell $s$ in the grid is assigned a subset of colors $\chi_s \subseteq \chi$ and should be…
An injective coloring of a graph $G$ is an assignment of colors to the vertices of $G$ so that any two vertices with a common neighbor have distinct colors. A graph $G$ is injectively $k$-choosable if for any list assignment $L$, where…
In this paper, we consider distributed coloring for planar graphs with a small number of colors. We present an optimal (up to a constant factor) $O(\log{n})$ time algorithm for 6-coloring planar graphs. Our algorithm is based on a novel…
We prove that every cyclically 4-edge-connected cubic graph that can be embedded in the torus, with the exceptional graph class called "Petersen-like", is 3-edge-colorable. This means every (non-trivial) toroidal snark can be obtained from…
We prove several new tight distributed lower bounds for classic symmetry breaking graph problems. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a $\Delta$-coloring on…
Exact solutions are presented of the Klein-Gordon equation of a charged particle moving in a classical monochromatic electromagnetic plane wave in a medium of index of refraction n < 1. The solutions are expressed in terms of Ince…
A graph $G$ is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer $k$ for which such a coloring exists…
In the first part of the paper, we classify linear integrable (multi-dimensionally consistent) quad-equations on bipartite isoradial quad-graphs in $\mathbb C$, enjoying natural symmetries and the property that the restriction of their…
The vertex cover problem is a fundamental and widely studied combinatorial optimization problem. It is known that its standard linear programming relaxation is integral for bipartite graphs and half-integral for general graphs. As a…
In this paper we discuss the existence, uniqueness and regularity of solutions of the following system of coupled semilinear Poisson equations on a smooth bounded domain $\Omega$ in $\mathbb{R}^n$: \[ \left\{{llll} \mathcal{A}^s u= v^p &…
We study a Tur\'an-type problem on edge-colored complete graphs. We show that for any $r$ and $t$, any sufficiently large $r$-edge-colored complete graph on $n$ vertices with $\Omega(n^{2-1/tr^r})$ edges in each color contains a member from…
We draw a connection between the affine invariant surface measures constructed by P. Gressman and the boundedness of a certain geometric averaging operator associated to surfaces of codimension $2$ and related to the Fourier Restriction…
We provide a polynomial-time algorithm for b-Coloring on graphs of constant clique-width. This unifies and extends nearly all previously known polynomial time results on graph classes, and answers open questions posed by Campos and Silva…
In 2019, Letzter confirmed a conjecture of Balogh, Bar\'at, Gerbner, Gy\'arf\'as and S\'ark\"ozy, proving that every large $2$-edge-coloured graph $G$ on $n$ vertices with minimum degree at least $3n/4$ can be partitioned into two…