Properly coloured copies and rainbow copies of large graphs with small maximum degree

Let G be a graph on n vertices with maximum degree ?. We use the Lovasz local lemma to show the following two results about colourings ? of the edges of the complete graph Kn. If for each vertex v of Kn the colouring ? assigns each colour to at most (n - 2)/(22.4?2) edges emanating from v, then there is a copy of G in Kn which is properly edge-coloured by ?. This improves on a result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4), 409433, 2003]. On the other hand, if ? assigns each colour to at most n/(51?2) edges of Kn, then there is a copy of G in Kn such that each edge of G receives a different colour from ?. This proves a conjecture of Frieze and Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a framework developed by Lu and Szekely [Electron. J. Comb. 14(1), R63, 2007] for applying the local lemma to random injections. In order to improve the constants in our results we use a version of the local lemma due to Bissacot, Fernandez, Procacci, and Scoppola [preprint, arXiv:0910.1824]. (c) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 425436, 2012

COPIES OF c(0)(Gamma) IN C(K, X) SPACES

We extend some results of Rosenthal, Cembranos, Freniche, E. Saab-P. Saab and Ryan to study the geometry of copies and complemented copies of c(0)(Gamma) in the classical Banach spaces C(K, X) in terms of the carclinality of the set Gamma, of the density and caliber of K and of the geometry of X and its dual space X*. Here are two sample consequences of our results: (1) If C([0, 1], X) contains a copy of c(0)(N-1), then X contains a copy of c(0)(N-1). (2) C(beta N, X) contains a complemented copy of c(0)(N-1) if and only if X contains a copy of c(0)(N-1). Some of our results depend on set-theoretic assumptions. For example, we prove that it is relatively consistent with ZFC that if C(K) contains a copy of c(0)(N-1) and X has dimension NI, then C(K, X) contains a complemented copy of cc(0)(N-1).