Atlas home || Conferences | Abstracts | about Atlas

22nd Cumberland Conference on Combinatorics, Graph Theory and Computing
May 21-23, 2009
Western Kentucky University
Bowling Green, KY, USA

Organizers
Bela Csaba, Chair; Mustafa Atici; Robert Crawford; Claus Ernst; Dominic Lanphier; Attila Por

View Abstracts
Conference Homepage

On a (5, 4)-edge coloring of Kn
by
Zachary Kudlak
University of Rhode Island
Coauthors: Lubos Thoma

For integers p ≤ n and q ≤ \binomp2 an edge coloring of Kn is said to be a (p, q)-edge coloring if for every induced subgraph on p vertices there are at least q colors used on its edges. Let f(n, p, q) be the minimum number of colors needed in such an edge coloring. Recently, D. Mubayi showed an upper bound on f(n, 4, 3). Extending his work, we show that
f(n, 5, 4) ≤ e2√{log2 ·logn}(1+o(1)).
Joint work with L. Thoma.

Date received: April 15, 2009

Copyright © 2009 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cayq-21.