RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive
Diskr. Mat., 2011 Volume 23, Issue 3, Pages 63–81 (Mi dm1153)
An asymptotic upper bound for the chromatic index of random hypergraphs

Yu. A. Budnikov


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.

UDC: 519.2

Received: 12.02.2010

DOI: 10.4213/dm1153


 English version: Discrete Mathematics and Applications, 2011, 21:4, 443–464

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024