相关论文: Fractional chromatic number of a random subgraph

A proper 2-tone $k$-coloring of a graph is a labeling of the vertices with elements from $\binom{[k]}{2}$ such that adjacent vertices receive disjoint labels and vertices distance 2 apart receive distinct labels. The 2-tone chromatic number…

For integers $k, r > 0$, a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to at least $\min\{r, d(v)\}$ differently colored…

Given a graph $G$ possibly with multiple edges but no loops, denote by $\Delta$ the {\it maximum degree}, $\mu$ the {\it multiplicity}, $\chi'$ the {\it chromatic index} and $\chi_f'$ the {\it fractional chromatic index} of $G$,…

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…

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…

The chromatic number $\chi(G)$ of a graph $G$ is defined as the minimum number of colours required for a vertex colouring where no two adjacent vertices are coloured the same. The chromatic number of the dense random graph $G \sim G(n,p)$…

We discuss the minimal number of vertices in a graph with a large chromatic number such that each ball of a fixed radius in it has a small chromatic number. It is shown that for every graph $G$ on $\sim((n+rc)/(c+rc))^{r+1}$ vertices such…

For integers $k>0$ and $0<r \leq \Delta$ (where $r \leq k$), a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to vertices with at…

We study a model of random graph where vertices are $n$ i.i.d. uniform random points on the unit sphere $S^d$ in $\mathbb{R}^{d+1}$, and a pair of vertices is connected if the Euclidean distance between them is at least $2- \epsilon$. We…

The local chromatic number is a coloring parameter defined as the minimum number of colors that should appear in the most colorful closed neighborhood of a vertex under any proper coloring of the graph. Its directed version is the same when…

Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…

A graph $G$ is $k$-{\em critical} if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. Recently the authors gave a lower…

Shamir and Spencer proved in the 1980s that the chromatic number of the binomial random graph G(n,p) is concentrated in an interval of length at most \omega\sqrt{n}, and in the 1990s Alon showed that an interval of length…

The dichromatic number of a digraph is the minimum integer $k$ such that it admits a $k$-dicolouring, i.e. a partition of its vertices into $k$ acyclic subdigraphs. We say that a digraph $D$ is a super-orientation of an undirected graph $G$…

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…

We prove that for any graph $G$, the total chromatic number of $G$ is at most $\Delta(G)+2\left\lceil \frac{|V(G)|}{\Delta(G)+1} \right\rceil$. This saves one color in comparison with a result of Hind from 1992. In particular, our result…

The local chromatic number of a graph G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G. We show that two specific topological obstructions that have the same…

Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdos conjectured that the random 2-edge-coloring minimizes the number of…

We develop further the new versions of quantum chromatic numbers of graphs introduced by the first and fourth authors. We prove that the problem of computation of the commuting quantum chromatic number of a graph is solvable by an SDP…

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…