|
Organizers |
Windswept Trees and Paths in the Random Graph
by
Jean A. Larson
University of Florida
Larson and Laflamme have investigated colorings with finitely many colors of paths with n edges in the countably infinite random graph, showing there is a critical value pn such that every coloring uses at most pn colors on some induced random subgraph and there is a coloring with this many colors such that all colors appear in every induced random subgraph.
Date received: March 9, 2005
Copyright © 2005 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 # capk-17.