相关论文: Unit distance graphs with ambiguous chromatic numb…

We present a new proof of the known fact that the chromatic number of the plane is at least 5. The main difference of this proof is that it can be verified manually without the help of the computer.

We consider the problem of $k$-colouring a random $r$-uniform hypergraph with $n$ vertices and $cn$ edges, where $k$, $r$, $c$ remain constant as $n$ tends to infinity. Achlioptas and Naor showed that the chromatic number of a random graph…

We prove that a graph on up to 9 vertices is a unit-distance graph if and only if it does not contain one of 74 so-called minimal forbidden graphs. This extends the work of Chilakamarri and Mahoney (1995), who provide a similar…

A proper coloring of a graph $G$ is said to be a strong odd coloring of $G$, if for every vertex $v$ and every color $c$, either $c$ appears on an odd number of vertices in the neighborhood of $v$ or $c$ is absent in the neighborhood of…

In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups.

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

The local chromatic number of a graph was introduced by Erdos et al. in 1986. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local chromatic number of graphs for which these quantities are…

We consider the chromatic numbers of unit-distance graphs of various annuli. In particular, we consider radial colorings, which are "nice" colorings, and completely determine the radial chromatic numbers of various annuli.

Topological indices are real numbers invariant under graph isomorphisms. Chromatic analogue of topological indices has been introduced recently in literature in 2017. Mainly, chromatic versions of Zagreb indices are studied lately. This…

An intersection graph of curves in the plane is called a string graph. Matousek almost completely settled a conjecture of the authors by showing that every string graph of m edges admits a vertex separator of size O(\sqrt{m}\log m). In the…

We construct a new graph on 120 vertices whose quantum and classical independence numbers are different. At the same time, we construct an infinite family of graphs whose quantum chromatic numbers are smaller than the classical chromatic…

Recently, Van Hoeve proposed an algorithm for graph coloring based on an integer flow formulation on decision diagrams for stable sets. We prove that the solution to the linear flow relaxation on exact decision diagrams determines the…

Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no such construction was known for intersection graphs of…

We consider the maximum chromatic number of hypergraphs consisting of cliques that have pairwise small intersections. Designs of the appropriate parameters produce optimal constructions, but these are known to exist only when the number of…

The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…

We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd distance from each other.

Using Ravenel's Thom spectrum $X(n)$, we introduce the concept of chromatic defect, which measures how far a spectrum is from being complex-orientable. We compute the chromatic defect of various examples of interest, such as finite spectra,…

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…

A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-chromatic number of a graph is the minimum number of colors…

We prove several consistency results in choiceless set theory ZF+DC regarding countable chromatic numbers of various algebraic hypergraphs on Euclidean spaces.