{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:36:56Z","timestamp":1787323016156,"version":"build-2736575974"},"reference-count":25,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>Let $\\mathbb{H}^{(k)}(n, N)$, where $k \\ge 2$, be a random hypergraph on the vertex set $[n] = \\{1, 2, \\dots, n\\}$ with $N$ edges drawn independently with replacement from all subsets of $[n]$ of size $k$. For $\\bar{d} = k N\/n$ and any $\\varepsilon &gt; 0$ we show that if $k = o(\\ln ({\\bar d}\/\\ln n))$ and $k = o(\\ln (n\/\\ln {\\bar d}))$, then with probability $1-o(1)$ a random greedy algorithm produces a proper edge coloring of $\\mathbb{H}^{(k)}(n, N)$ with at most $\\bar{d} (1+\\varepsilon)$ colors. This yields the asymptotic chromatic number of the corresponding uniform random intersection graph.<\/jats:p>","DOI":"10.1137\/130942292","type":"journal-article","created":{"date-parts":[[2015,3,24]],"date-time":"2015-03-24T16:20:56Z","timestamp":1427214056000},"page":"541-558","source":"Crossref","is-referenced-by-count":3,"title":["On the Chromatic Index of Random Uniform Hypergraphs"],"prefix":"10.1137","volume":"29","author":[{"given":"Valentas","family":"Kurauskas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katarzyna","family":"Rybarczyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,3,24]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.2728"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309990253"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"J. Balogh, S. Das, M. Delcourt, H. Liu, and M. Sharifzadeh,\n                      The Typical Structure of Intersecting Families of Discrete Structures\n                      , arXiv:1408.2559, 2014.","DOI":"10.1016\/j.jcta.2015.01.003"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1137\/050647153"},{"key":"atypb5","first-page":"11","volume":"45","author":"Berge C.","year":"1990","journal-title":"Matematiche (Catania)"},{"key":"atypb6","doi-asserted-by":"crossref","unstructured":"M. Bloznelis, J. Jaworski, E. Godehardt, V. Kurauskas, and K. Rybarczyk,\n                      Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs\n                      , in Data Science, Learning by Latent Structures, and Knowledge Discovery, B. Lausen, S. Krolak-Schwerdt, M. B. Bo\u0308hmer, eds., Springer, 2015.","DOI":"10.1007\/978-3-662-44983-7_6"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"M. Bloznelis, J. Jaworski, E. Godehardt, V. Kurauskas, and K. Rybarczyk,\n                      Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs\n                      , in Data Science, Learning by Latent Structures, and Knowledge Discovery, B. Lausen, S. Krolak-Schwerdt, M. B. Bo\u0308hmer, eds., Springer, 2015.","DOI":"10.1007\/978-3-662-44983-7_7"},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"M. Bloznelis and V. Kurauskas,\n                      Large Cliques in Sparse Random Intersection Graphs\n                      , arXiv:1302.4627, 2013.","DOI":"10.1214\/12-AAP874"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122551"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100053056"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2009.02.018"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90149-C"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<5::AID-RSA2>3.0.CO;2-Z"},{"key":"atypb14","first-page":"67","author":"Godehardt E.","year":"2003","journal-title":"Berlin"},{"key":"atypb15","unstructured":"M. Gauy, H. Ha\u0300n, and I. Oliveira,\n                      Erdo\u0308s-Ko-Rado for Random Hypergraphs: Asymptotic Bounds and Stability\n                      , arXiv:1409.3634, 2014."},{"key":"atypb16","doi-asserted-by":"crossref","unstructured":"S. Janson, T. \u0141 uczak, and A. Rucin\u0301ski,\n                      Random Graphs\n                      , Wiley, New York, 2001.","DOI":"10.1002\/9781118032718"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003459"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01375472"},{"key":"atypb19","unstructured":"D. Matula,\n                      The Largest Clique Size in a Random Graph\n                      , Technical report, Department of Computer Science, Southern Methodist University, Dallas, TX, 1976."},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12788-9_6"},{"key":"atypb21","first-page":"600","author":"Nikoletseas S. E.","year":"2009","journal-title":"Berlin"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90074-5"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.01.006"},{"key":"atypb24","first-page":"25","volume":"3","author":"Vizing V. G.","year":"1964","journal-title":"Diskret. Analiz."},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004612"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/130942292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:37:18Z","timestamp":1787319438000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/130942292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/130942292"],"URL":"https:\/\/doi.org\/10.1137\/130942292","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}