Opening book details…
Can I read Asymptotics of the Chromatic Index for Multigraphs on EtoBox?
Asymptotics of the Chromatic Index for Multigraphs by Jeff Kahn is a Computer Science article available to read on EtoBox.
What is Asymptotics of the Chromatic Index for Multigraphs about?
For a multigraph G, let D(G) denote maximum degree and set We show that the chromatic index /$(G) is asymptotically max[D(G), 1(G)]. The latter is, by a theorem of Edmonds (1965), the fractional chromatic index of G, and the asymptotics established here are part of a conjecture of the author predicting similar agreement of fractional and ordinary chromatic indices for more general hypergraphs. Of particular interest in the present proof is the use of probabilistic ideas and ``hard-core'' distributions to go from fractional to ordinary (integer) colorings.
Who reads Asymptotics of the Chromatic Index for Multigraphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Jeff Kahn
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0095-8956)
- Published
- 1996
- Language
- EN
- Field
- Computer Science (Physical Sciences)