Related papers: More certainty in coloring the plane with a forbid…
The {\em chromatic gap} is the difference between the chromatic number and the clique number of a graph. Here we investigate $\gap(n)$, the maximum chromatic gap over graphs on $n$ vertices. Can the extremal graphs be explored? While…
Higher chromatic numbers $\chi_s$ of simplicial complexes naturally generalize the chromatic number $\chi_1$ of a graph. In any fixed dimension $d$, the $s$-chromatic number $\chi_s$ of $d$-complexes can become arbitrarily large for…
Let $G$ be a graph with chromatic number $\chi$, maximum degree $\Delta$ and clique number $\omega$. Reed's conjecture states that $\chi \leq \lceil (1-\varepsilon)(\Delta + 1) + \varepsilon\omega \rceil$ for all $\varepsilon \leq 1/2$. It…
Let $P$ be a set of $n$ points in strictly convex position in the plane. Let $D_n$ be the graph whose vertex set is the set of all line segments with endpoints in $P$, where disjoint segments are adjacent. The chromatic number of this graph…
We present a tiling of more than 99.985698% of the Euclidean plane with six colors, reducing the previous record for uncovered fraction of the plane by about 12.8%. We also present a tiling of more than 95.99% of the plane with five colors.…
The chromatic number $\chi(G)$ of a graph $G$, that is, the smallest number of colors required to color the vertices of $G$ so that no two adjacent vertices are assigned the same color, is a classic and extensively studied parameter. Here…
This article is about chromatic numbers of hyperbolic surfaces. For a metric space, the $d$-chromatic number is the minimum number of colors needed to color the points of the space so that any two points at distance $d$ are of a different…
Let n>0 be a number. Let Gn be the graph on n-dimensional Euclidean space connecting points of rational distance. It is consistent with the choiceless theory ZF+DC that Gn has countable chromatic number yet Gn+1 does not.
A line coloring of PG$(n,q)$, the $n$-dimensional projective space over GF$(q)$, is an assignment of colors to all lines of PG$(n,q)$ so that any two lines with the same color do not intersect. The chromatic index of PG$(n,q)$, denoted by…
The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that vertices of $G$ can be partitioned into disjoint classes $X_1, ..., X_k$ where vertices in $X_i$ have pairwise distance greater than $i$. We…
We consider two graph colouring problems in which edges at distance at most $t$ are given distinct colours, for some fixed positive integer $t$. We obtain two upper bounds for the distance-$t$ chromatic index, the least number of colours…
We present two novel six-colorings of the Euclidean plane that avoid monochromatic pairs of points at unit distance in five colors and monochromatic pairs at another specified distance $d$ in the sixth color. Such colorings have previously…
The Hadwiger-Nelson problem asks for the minimum number of colors, so that each point of the plane can be assigned a single color with the property that no two points unit-distance apart are identically colored. It is now known that the…
The chromatic number of an planar graph is not greater than four and this is known by the famous four color theorem and is equal to two when the planar graph is bipartite. When the planar graph is even-triangulated or all cycles are greater…
The {\em acyclic chromatic number} of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. The {\em acyclic chromatic index} is the analogous graph parameter for edge…
In 1976 Simmons conjectured that every coloring of a 2-dimensional sphere of radius strictly greater than $1/2$ in three colors has a couple of monochromatic points at the distance 1 apart. We prove this conjecture.
Let $G$ be a simple graph with $n$ vertices and list chromatic number $\chi_\ell(G)=\chi_\ell$. Suppose that $0\leq t\leq \chi_\ell$ and each vertex of $G$ is assigned a list of $t$ colors. Albertson, Grossman and Haas [1] conjectured that…
The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…
If a graph has bounded clique number, and sufficiently large chromatic number, what can we say about its induced subgraphs? Andr\'as Gy\'arf\'as made a number of challenging conjectures about this in the early 1980's, which have remained…
A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. .. , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-distance chromatic number $\chi$ 2 (G) of G is then the mallest…