Asymptotics of the list-chromatic index for multigraphs

Random Structures and Algorithms

Volumn 17, Issue 2, 2000, Pages 117-156

  Kahn, Jeff ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034417178     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9     Document Type: Article

References (61)

1. M. Ajtai, J. Komlós and E. Szemerédi, A dense infinite Sidon sequence, Europ J Combinatorics 2 (1981), 1-11.
2. N. Alon, "Restricted colorings of graphs," Surveys in Combinatorics, 1993 (Proc. 14th British Combinatorial Conf.), Cambridge Univ. Press, Cambridge, 1993, pp. 1-33.
3. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
4. N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica 12 (1992), 125-134.
5. L.D. Andersen, On edge-colourings of graphs, Math Scand 40 (1977), 161-175.
6. J. van den Berg and J.E. Steif, Percolation and the hard-core lattice gas model, Stochastic Processes Appl. 49 (1994), 179-197.
7. B. Bollobás, "Martingales, isoperimetric inequalities and random graphs," Combinatorics, A. Hajnal, L. Lovász and V.T. Sós (Editors), Colloq. Math. Soc. János Bolyai 52, North Holland, Amsterdam, 1988.
8. B. Bollobás and A.J. Harris, List-colourings of graphs, Graphs Combinatorics 1 (1985), 115-127.
9. J. Edmonds, Maximum matching and a polyhedron with 0, 1-vertices, J Res Nat Bureau of Standards (B) 69 (1965), 125-130.
10. P. Erdos, Some old and new problems in various branches of combinatorics, Congressus Numerantium 23 (1979), 19-37.
11. P. Erdos and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Coll Math Soc J Bolyai 10 (1974), 609-627.
12. P. Erdos, A. Rubin, and H. Taylor, Choosability in graphs, Congressus Numerantium 26 (1979), 125-157.
13. P. Erdos and J. Spencer, Lopsided Lovász Local Lemma and Latin transversals, Discr Appl Math 30 (1990), 151-154.
14. P. Frankl and V. Rödl, Near-perfect coverings in graphs and hypergraphs, Europ J Combinatorics 6 (1985), 317-326.
15. Z. Füredi, Matchings and covers in hypergraphs, Graphs Combinatorics 4 (1988), 115-206.
16. F. Galvin, The list chromatic index of a bipartite multigraph, J Combinatorial Th (B) 63 (1995), 153-158.
17. C.D. Godsil, Matchings and walks in graphs, J Graph Th 5 (1981), 285-297.
18. M.K. Goldberg, On multigraphs of almost maximal chromatic class, Diskret Analiz 23 (1973), 3-7 (Russian).
19. R.Häggkvist and J.C.M. Janssen, On the list-chromatic index of bipartite graphs, manuscript, 1993.
20. O.J. Heilmann and E.H. Lieb, Monomers and dimers, Phys Rev Lett 24 (1970), 1412-1414.
21. O.J. Heilmann and E.H. Lieb, Theory of monomer-dimer systems, Comm Math Phys 25 (1972), 190-232.
22. H.R.F. Hind, Restricted edge-colourings, Doctoral thesis, Peterhouse College, Cambridge, 1988.
23. J.C.M. Janssen, The Dinitz problem solved for rectangles, Bull Amer Math Soc 29 (1993), 243-249.
24. A. Johansson, An improved upper bound on the choice number for triangle free graphs, manuscript, 1994.
25. J. Kahn, Coloring nearly-disjoint hypergraphs with n + o(n) colors, J Combinatorial Th (A) 59 (1992), 31-39.
26. [26) J. Kahn, "Recent results on some not-so-recent hypergraph matching and covering problems," Extremal Problems for Finite Sets, Visegrád, 1991, Bolyai Soc. Math. Studies, János Bolyai Math. Soc., Budapest, Vol. 3, 1994, pp. 305-353.
27. J. Kahn, Asymptotically good list-colorings, J Combinatorial Th (A) 73 (1996), 1-59.
28. J. Kahn, "On some hypergraph problems of Paul Erdos and the asymptotics of matchings, covers and colorings," The Mathematics of Paul Erdos, Vol. 1, Springer, Berlin, 1997, pp. 345-371.
29. J. Kahn, A linear programming perspective on the Frankl-Rödl-Pippenger Theorem, Random Struct Algorithms 8 (1996), 149-157.
30. J. Kahn, Asymptotics of the chromatic index for multigraphs, J Combinatorial Th (B) 68 (1996), 233-254.
31. J. Kahn and P.M. Kayll, On the stochastic independence properties of hardcore distributions Combinatorica 7 (1997), 369-391.
32. J. Kahn and P.M. Kayll, Fractional vs. integer covers in hypergraphs of bounded edge size, J Combinatorial Th (A) 78 (1997), 199-235.
33. J. Kahn and J.H. Kim, Random matchings in regular graphs, Combinatorica 18 (1998), 201-226.
34. J.H. Kim, On Brooks' Theorem for sparse graphs, Combinatorics, Probability Computing 4 (1995), 97-132.
35. 2/logt, Random Struct Algorithms 7 (1995), 173-207.
36. D. König, Über Graphen und ihre Andwendung auf Determinantentheorie und Mengenlehre, Math Ann 77 (1916), 453-465.
37. D. König, Graphok és alkalmazásuk a determinánsok és a halmazok elméletére, Math Termész Ért 34 (1916), 104-119.
38. H. Kunz, Location of the zeros of the partition function for some classical lattice systems, Phys Lett (A) (1970), 311-312.
39. C.W. Lee, "Some recent results on convex polytopes," Contemporary Mathematics, AMS, Providence, RI, 1990, pp. 3-19.
40. C.W. Lee, Convex polytopes, the moment map, and canonical convex combinations, manuscript, 1994.
41. T.M. Liggett, Interacting Particle Systems, Springer, New York, 1985.
42. G.M. Louth, Stochastic Networks: Complexity, Dependence and Routing, Thesis, Cambridge University, 1990.
43. L. Lovász and M.D. Plummer, Matching Theory, North Holland, Amsterdam, 1986.
44. C.J.H. McDiarmid, On the method of bounded differences, Surveys in Combinatorics 1989, Invited Papers at the 12th British Combinatorial Conference, J. Siemons (Editor), Cambridge University Press, Cambridge, 1989, pp. 148-188.
45. V. Milman and G. Schechtman, Asymptotic Theory of Finite Dimensional Normed Spaces, Springer, Berlin, 1980.
46. T. Nishizeki and K. Kashiwagi, "An upper bound on the chromatic index of multigraphs," Graph Theory with Applications to Algorithms and Computer Science Y. Alavi et al. (Editors), Wiley, New York, 1985.
47. T. Nishizeki and K. Kashiwagi, On the 1.1 edge-coloring of multigraphs, SIAM J Disc Math 3 (1990), 391-410.
48. N. Pippenger, unpublished (see [55], [15]).
49. N. Pippenger and J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs, J Combinatorial Th (A) 51 (1989), 24-42.
50. Y. Rabinovich, A. Sinclair, and A. Wigderson, Quadratic Dynamical Systems, Proc. 33rd IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1992, pp. 304-313.
51. V. Rödl, On a packing and covering problem, Europ J Combinatorics 5 (1985), 69-78.
52. A. Schrijver, Theory of Linear and Integer Programming, Wiley, Chichester, 1986.
53. P.D. Seymour, "Some unsolved problems on one-factorizations of graphs," Graph Theory and Related Topics, J.A. Bondy and U.S.R. Murty (Editors), Academic Press, New York, 1979.
54. C.E. Shannon, A theorem on coloring the lines of a network, J Math Phys 28 (1949), 148-151.
55. J. Spencer, Lecture notes, M.I.T., 1987.
56. J. Spencer, Asymptotic packing via a branching process, Random Struct Algorithms 7 (1995), 167-172.
57. M. Talagrand, Concentration of measure and isoperimetric inequalities in product spaces, Publ Math IHES 81 (1995), 73-205.
58. V.G. Vizing, On an estimate of the chromatic class of a p-graph (in Russian), Diskret Analiz 3 (1964), 25-30.
59. V.G. Vizing, The chromatic class of a multigraph, Kibernetica (Kiev) 3 (1965) 29-39 [Cybernetics 3 (1965), 32-41].
60. V.G. Vizing, The chromatic class of a multigraph, Kibernetica (Kiev) 3 (1965) 29-39 [Cybernetics 3 (1965), 32-41].
61. V.G. Vizing, Coloring the vertices of a graph in prescribed colors (in Russian), Diskret Analiz No 29 Metody Diskret Anal v Teorii Kodov i Shem (1976), 3-10, 101 (MR58 #16371).