Abstract
We give an asymptotic upper bound for the chromatic index of a random hypergraph in the case where the edge length of the hypergraph is an increasing function of the number of vertices of the hypergraph.
null Chubarikov, Vladimir N. / Ershov, Yu. L. / Prokhorov, Yuri V.
6 Issues per year
Issues
Volume 22 (2012)
Volume 21 (2011)
Volume 20 (2010)
Volume 19 (2009)
Volume 18 (2008)
Volume 17 (2007)
Volume 16 (2006)
Volume 15 (2005)
Volume 14 (2004)
Volume 13 (2003)
Volume 11 (2001)
Volume 10 (2000)
Volume 9 (1999)
Volume 8 (1998)
Volume 7 (1997)
Volume 6 (1996)
Volume 5 (1995)
Volume 4 (1994)
Volume 3 (1993)
Volume 2 (1992)
An asymptotic upper bound for the chromatic index of random hypergraphs
Budnikov, Yu. A.
Citation Information: Discrete Mathematics and Applications. Volume 21, Issue 4, Pages 443–464, ISSN (Online) 1569-3929, ISSN (Print) 0924-9265, DOI: 10.1515/dma.2011.028, November 2011
Publication History:
Received: 12/02/2010;
Published Online: 26/02/2012
Comments (0)