4171 search results - page 53 / 835 » Choice numbers of graphs |
CORR
2011
Springer
14 years 6 months ago
2011
Springer
TIT
2011
14 years 6 months ago
2011
111
click to vote
DM
1998
14 years 11 months ago
1998
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
COMBINATORICA
2006
14 years 12 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...