724 research outputs found
Induced Ramsey-type theorems
We present a unified approach to proving Ramsey-type theorems for graphs with
a forbidden induced subgraph which can be used to extend and improve the
earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham,
and Luczak-Rodl. The proofs are based on a simple lemma (generalizing one by
Graham, Rodl, and Rucinski) that can be used as a replacement for Szemeredi's
regularity lemma, thereby giving much better bounds. The same approach can be
also used to show that pseudo-random graphs have strong induced Ramsey
properties. This leads to explicit constructions for upper bounds on various
induced Ramsey numbers.Comment: 30 page
The history of degenerate (bipartite) extremal graph problems
This paper is a survey on Extremal Graph Theory, primarily focusing on the
case when one of the excluded graphs is bipartite. On one hand we give an
introduction to this field and also describe many important results, methods,
problems, and constructions.Comment: 97 pages, 11 figures, many problems. This is the preliminary version
of our survey presented in Erdos 100. In this version 2 only a citation was
complete
The incidence game chromatic number
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For k-degenerate graphs with maximum degree D, the upper bound 2D+4k-2 for the incidence game chromatic number is given. If D is at least 5k, we improve this bound to the value 2D+3k-1. We also determine the exact incidence game chromatic number of cycles, stars and sufficiently large wheels and obtain the lower bound 3D/2 for the incidence game chromatic number of graphs of maximum degree D
Degenerate and star colorings of graphs on surfaces
AbstractWe study the degenerate, the star and the degenerate star chromatic numbers and their relation to the genus of graphs. As a tool we prove the following strengthening of a result of Fertin et al. (2004) [8]: If G is a graph of maximum degree Δ, then G admits a degenerate star coloring using O(Δ3/2) colors. We use this result to prove that every graph of genus g admits a degenerate star coloring with O(g3/5) colors. It is also shown that these results are sharp up to a logarithmic factor
- …