5 research outputs found
Beyond Ohba's Conjecture: A bound on the choice number of -chromatic graphs with vertices
Let denote the choice number of a graph (also called "list
chromatic number" or "choosability" of ). Noel, Reed, and Wu proved the
conjecture of Ohba that when . We
extend this to a general upper bound: . Our result is sharp for
using Ohba's examples, and it improves the best-known
upper bound for .Comment: 14 page
On Choosability and Paintability of Graphs
abstract: Let be a graph. A \emph{list assignment} for is a function from
to subsets of the natural numbers. An -\emph{coloring} is a function
with domain such that for all vertices and
whenever . If for all then is a -\emph{list
assignment}. The graph is -choosable if for every -list assignment
there is an -coloring. The least such that is -choosable is called
the list chromatic number of , and is denoted by . The complete multipartite
graph with parts, each of size is denoted by . Erd\H{o}s et al.
suggested the problem of determining \ensuremath{\ch(K_{s*k})}, and showed that
. Alon gave bounds of the form . Kierstead proved
the exact bound . Here it is proved that
.
An online version of the list coloring problem was introduced independently by Schauz
and Zhu. It can be formulated as a game between two players, Alice and Bob. Alice
designs lists of colors for all vertices, but does not tell Bob, and is allowed to
change her mind about unrevealed colors as the game progresses. On her -th turn
Alice reveals all vertices with in their list. On his -th turn Bob decides,
irrevocably, which (independent set) of these vertices to color with . For a
function from to the natural numbers, Bob wins the -\emph{game} if
eventually he colors every vertex before has had colors of its
list revealed by Alice; otherwise Alice wins. The graph is -\emph{online
choosable} or \emph{-paintable} if Bob has a strategy to win the -game. If
for all and is -paintable, then is t-paintable.
The \emph{online list chromatic number }of is the least such that
is -paintable, and is denoted by \ensuremath{\ch^{\mathrm{OL}}(G)}. Evidently,
. Zhu conjectured that the gap
can be arbitrarily large. However there are only a few known examples with this gap
equal to one, and none with larger gap. This conjecture is explored in this thesis.
One of the obstacles is that there are not many graphs whose exact list coloring
number is known. This is one of the motivations for establishing new cases of Erd\H{o}s'
problem. Here new examples of graphs with gap one are found, and related technical
results are developed as tools for attacking Zhu's conjecture.
The square of a graph is formed by adding edges between all vertices
at distance . It was conjectured that every graph satisfies .
This was recently disproved for specially constructed graphs. Here it is shown that
a graph arising naturally in the theory of cellular networks is also a counterexample.Dissertation/ThesisDoctoral Dissertation Mathematics 201
Ohba’s conjecture and beyond for generalized colorings
Let be a graph. Ohba's conjecture states that if , then . Noel, West, Wu and Zhu extended this result and proved that for any graph, . Ohba, Kierstead and Noel proved that this bound is sharp for the ordinary chromatic number. In this work we prove that both results hold for generalized colorings as well, and find examples that prove the sharpness of the second one for the acyclic and star chromatic numbers