|
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.
Received: 12.02.2010
Citation:
Yu. A. Budnikov, “An asymptotic upper bound for the chromatic index of random hypergraphs”, Diskr. Mat., 23:3 (2011), 63–81; Discrete Math. Appl., 21:4 (2011), 443–464
Linking options:
https://www.mathnet.ru/eng/dm1153https://doi.org/10.4213/dm1153 https://www.mathnet.ru/eng/dm/v23/i3/p63
|
Statistics & downloads: |
Abstract page: | 521 | Full-text PDF : | 210 | References: | 54 | First page: | 16 |
|