{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T09:08:37Z","timestamp":1768295317786,"version":"3.49.0"},"reference-count":60,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct. Alg."],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1002\/1098-2418(200009)17:2<117::aid-rsa3>3.0.co;2-9","type":"journal-article","created":{"date-parts":[[2004,11,20]],"date-time":"2004-11-20T12:05:53Z","timestamp":1100952353000},"page":"117-156","source":"Crossref","is-referenced-by-count":15,"title":["Asymptotics of the list-chromatic index for multigraphs"],"prefix":"10.1002","volume":"17","author":[{"given":"Jeff","family":"Kahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0195-6698(81)80014-5","volume":"2","author":"Ajtai","year":"1981","journal-title":"Europ J Combinatorics"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/CBO9780511662089.002","volume-title":"Surveys in Combinatorics, 1993 (Proc. 14th British Combinatorial Conf.)","author":"Alon","year":"1993","unstructured":"? Restricted colorings of graphs,? Surveys in Combinatorics, 1993 (Proc. 14th British Combinatorial Conf.), Cambridge Univ. Press, Cambridge, 1993, pp. 1-33."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB3","volume-title":"The Probabilistic Method","author":"Alon","year":"1992","unstructured":"and The Probabilistic Method, Wiley, New York, 1992."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"Alon","year":"1992","journal-title":"Combinatorica"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7146\/math.scand.a-11685","volume":"40","author":"Andersen","year":"1977","journal-title":"Math Scand"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0304-4149(94)90132-5","volume":"49","author":"van den Berg","year":"1994","journal-title":"Stochastic Processes Appl."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB7","series-title":"Colloq. Math.","volume-title":"Combinatorics","volume":"52","author":"Bollob\u00e1s","year":"1988","unstructured":"? Martingales, isoperimetric inequalities and random graphs,? Combinatorics, and (Editors), Colloq. Math. Soc. J\u00e1nos Bolyai 52, North Holland Amsterdam 1988."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02582936","volume":"1","author":"Bollob\u00e1s","year":"1985","journal-title":"Graphs Combinatorics"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"Edmonds","year":"1965","journal-title":"J Res Nat Bureau of Standards (B)"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB10","first-page":"19","volume":"23","author":"Erd?s","year":"1979","journal-title":"Congressus Numerantium"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB11","first-page":"609","volume":"10","author":"Erd?s","year":"1974","journal-title":"Coll Math Soc J Bolyai"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB12","first-page":"125","volume":"26","author":"Erd?s","year":"1979","journal-title":"Congressus Numerantium"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90040-4","volume":"30","author":"Erd?s","year":"1990","journal-title":"Discr Appl Math"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0195-6698(85)80045-7","volume":"6","author":"Frankl","year":"1985","journal-title":"Europ J Combinatorics"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"F\u00fcredi","year":"1988","journal-title":"Graphs Combinatorics"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jctb.1995.1011","volume":"63","author":"Galvin","year":"1995","journal-title":"J Combinatorial Th (B)"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/jgt.3190050310","volume":"5","author":"Godsil","year":"1981","journal-title":"J Graph Th"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB18","first-page":"3","volume":"23","author":"Goldberg","year":"1973","journal-title":"Diskret Analiz"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB19","author":"H\u00e4ggkvist","year":"1993","unstructured":"and On the list-chromatic index of bipartite graphs, manuscript, 1993."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB20","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1103\/PhysRevLett.24.1412","volume":"24","author":"Heilmann","year":"1970","journal-title":"Phys Rev Lett"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB21","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BF01877590","volume":"25","author":"Heilmann","year":"1972","journal-title":"Comm Math Phys"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB22","author":"Hind","year":"1988","unstructured":"Restricted edge-colourings, Doctoral thesis, Peterhouse College, Cambridge, 1988."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0273-0979-1993-00430-0","volume":"29","author":"Janssen","year":"1993","journal-title":"Bull Amer Math Soc"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB24","author":"Johansson","year":"1994","unstructured":"An improved upper bound on the choice number for triangle free graphs, manuscript, 1994."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0097-3165(92)90096-D","volume":"59","author":"Kahn","year":"1992","journal-title":"J Combinatorial Th (A)"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB26","series-title":"Bolyai Soc. M","first-page":"305","volume-title":"Extremal Problems for Finite Sets, Visegr\u00e1d","volume":"3","author":"Kahn","year":"1991","unstructured":"? Recent results on some not-so-recent hypergraph matching and covering problems,? Extremal Problems for Finite Sets, Visegr\u00e1d, 1991, Bolyai Soc. Math. Studies, J\u00e1nos Bolyai Math. Soc., Budapest, Vol. 3, 1994, pp. 305-353."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcta.1996.0001","volume":"73","author":"Kahn","year":"1996","journal-title":"J Combinatorial Th (A)"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB28","series-title":"The Mathemati","first-page":"345","volume-title":"On some hypergraph problems of Paul Erd?s and the asymptotics of matchings, covers and colorings","volume":"1","author":"Kahn","year":"1997","unstructured":"? On some hypergraph problems of Paul Erd?s and the asymptotics of matchings, covers and colorings,? The Mathematics of Paul Erd?s, Vol. 1, Springer, Berlin, 1997, pp. 345-371."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB29","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/(SICI)1098-2418(199603)8:2<149::AID-RSA5>3.0.CO;2-Y","volume":"8","author":"Kahn","year":"1996","journal-title":"Random Struct Algorithms"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1006\/jctb.1996.0067","volume":"68","author":"Kahn","year":"1996","journal-title":"J Combinatorial Th (B)"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB31","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01215919","volume":"7","author":"Kahn","year":"1997","journal-title":"Combinatorica"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB32","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1006\/jcta.1997.2761","volume":"78","author":"Kahn","year":"1997","journal-title":"J Combinatorial Th (A)"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB33","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/PL00009817","volume":"18","author":"Kahn","year":"1998","journal-title":"Combinatorica"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB34","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S0963548300001528","volume":"4","author":"Kim","year":"1995","journal-title":"Combinatorics, Probability Computing"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB35","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/rsa.3240070302","volume":"7","author":"Kim","year":"1995","journal-title":"Random Struct Algorithms"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB36","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"K\u00f6nig","year":"1916","journal-title":"Math Ann"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB37","first-page":"104","volume":"34","author":"K\u00f6nig","year":"1916","journal-title":"Math Term\u00e9sz \u00c9rt"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB38","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0375-9601(70)90520-7","author":"Kunz","year":"1970","journal-title":"Phys Lett (A)"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB39","series-title":"Contemporary","first-page":"3","volume-title":"Some recent results on convex polytopes","author":"Lee","year":"1990","unstructured":"? Some recent results on convex polytopes,? Contemporary Mathematics, AMS, Providence, RI, 1990, pp. 3-19."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB40","author":"Lee","year":"1994","unstructured":"Convex polytopes, the moment map, and canonical convex combinations, manuscript, 1994."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB41","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8542-4","volume-title":"Interacting Particle Systems","author":"Liggett","year":"1985","unstructured":"Interacting Particle Systems, Springer, New York, 1985."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB42","author":"Louth","year":"1990","unstructured":"Stochastic Networks: Complexity, Dependence and Routing, Thesis, Cambridge University, 1990."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB43","volume-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986","unstructured":"and Matching Theory, North Holland, Amsterdam, 1986."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB44","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1017\/CBO9781107359949.008","volume-title":"Surveys in Combinatorics 1989, Invited Papers at the 12th British Combinatorial Conference","author":"McDiarmid","year":"1989","unstructured":"On the method of bounded differences, Surveys in Combinatorics 1989, Invited Papers at the 12th British Combinatorial Conference, (Editor), Cambridge University Press, Cambridge, 1989, pp. 148-188."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB45","volume-title":"Asymptotic Theory of Finite Dimensional Normed Spaces","author":"Milman","year":"1980","unstructured":"and Asymptotic Theory of Finite Dimensional Normed Spaces, Springer, Berlin, 1980."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB46","volume-title":"Graph Theory with Applications to Algorithms and Computer Science","author":"Nishizeki","year":"1985","unstructured":"and ? An upper bound on the chromatic index of multigraphs,? Graph Theory with Applications to Algorithms and Computer Science et al. (Editors), Wiley, New York, 1985."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB47","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/0403035","volume":"3","author":"Nishizeki","year":"1990","journal-title":"SIAM J Disc Math"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB48","author":"Pippenger","unstructured":"unpublished (see [45], [15])."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB49","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0097-3165(89)90074-5","volume":"51","author":"Pippenger","year":"1989","journal-title":"J Combinatorial Th (A)"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB50","author":"Rabinovich","year":"1992","unstructured":"and Quadratic Dynamical Systems, Proc. 33rd IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1992, pp. 304-313."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB51","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"5","author":"R\u00f6dl","year":"1985","journal-title":"Europ J Combinatorics"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB52","volume-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986","unstructured":"Theory of Linear and Integer Programming, Wiley, Chichester, 1986."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB53","volume-title":"Graph Theory and Related Topics","author":"Seymour","year":"1979","unstructured":"? Some unsolved problems on one-factorizations of graphs,? Graph Theory and Related Topics, and (Editors), Academic Press, New York, 1979."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB54","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"Shannon","year":"1949","journal-title":"J Math Phys"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB55","author":"Spencer","year":"1987","unstructured":"Lecture notes, M.I.T., 1987."},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB56","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/rsa.3240070206","volume":"7","author":"Spencer","year":"1995","journal-title":"Random Struct Algorithms"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB57","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02699376","volume":"81","author":"Talagrand","year":"1995","journal-title":"Publ Math IHES"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB58","first-page":"25","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret Analiz"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB59","first-page":"29","volume":"3","author":"Vizing","year":"1965","journal-title":"Kibernetica (Kiev)"},{"key":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9-BIB60","first-page":"3","volume":"101","author":"Vizing","year":"1976","journal-title":"Diskret Analiz No 29 MetodyDiskret Anal v Teorii Kodov i Shem"}],"container-title":["Random Structures and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1098-2418(200009)17:2%3C117::AID-RSA3%3E3.0.CO;2-9","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1098-2418(200009)17:2%3C117::AID-RSA3%3E3.0.CO;2-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T02:17:28Z","timestamp":1625105848000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,9]]}},"URL":"https:\/\/doi.org\/10.1002\/1098-2418(200009)17:2<117::aid-rsa3>3.0.co;2-9","relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}