Asymptotically Good List-Colorings

  title={Asymptotically Good List-Colorings},
  author={Jeff Kahn},
  journal={J. Comb. Theory, Ser. A},
Thus if edge sizes are bounded and pairwise degrees are relatively small, we have asymptotic agreement of /$l with its trivial lower bound, the maximum degree. The corresponding result for ordinary chromatic index is a theorem of Pippenger and Spencer (J. Combin. Theory Ser. A 51 (1989), 24 42). On the other hand, even for simple graphs, earlier work falls far short of deciding the asymptotic behavior of /$l . The ``guided-random'' method used in the proof is in the spirit of some earlier work… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 97 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 62 extracted citations

Extension from Precoloured Sets of Edges

Electr. J. Comb. • 2018
View 7 Excerpts
Highly Influenced

Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond

Electronic Notes in Discrete Mathematics • 2013
View 4 Excerpts
Highly Influenced

Randomly colouring graphs (a combinatorial view)

Computer Science Review • 2008
View 16 Excerpts
Highly Influenced

Fractional Decompositions of Dense Hypergraphs

View 3 Excerpts
Highly Influenced

More-Than-Nearly-Perfect Packings and Partial Designs

Combinatorica • 1999
View 6 Excerpts
Highly Influenced

Edge Coloring with Delays

View 3 Excerpts
Highly Influenced

98 Citations

Citations per Year
Semantic Scholar estimates that this publication has 98 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 43 references

A new upper bound for the list chromatic number

Discrete Mathematics • 1989
View 8 Excerpts
Highly Influenced

Asymptotic behavior of the chromatic index for hypergraphs

J. Comb. Theory, Ser. A • 1989
View 12 Excerpts
Highly Influenced

Coloring the vertices of a graph in prescribed colors, in ``Metody Diskret

V. G. Vizing
Anal. v Teorii Kodov i Shem,'' pp. 3 10, 101, Diskret. Analiz., Vol. 29, MR58 *16371, • 1976
View 11 Excerpts
Highly Influenced

On a limit theorem in combinatorial analysis

P. Erdo s, H. Hanani
Publ. Math. Debrecen • 1963
View 4 Excerpts
Highly Influenced

On Even and Odd Latin Squares

J. Comb. Theory, Ser. A • 1995
View 7 Excerpts
Highly Influenced

Recent results on some not-so-recent hypergraph matching and covering problems, in ``Extremal Problems for Finite Sets, Visegra d, 1991,'' Vol

J. Kahn
3, pp. 305 353, Bolyai Soc. Math. Studies, • 1994
View 4 Excerpts
Highly Influenced

On the list-chromatic index of bipartite graphs, manuscript

R. Ha ggkvist, J.C.M. Janssen
Restricted edge-colourings, • 1993
View 8 Excerpts
Highly Influenced

A Dense Infinite Sidon Sequence

View 4 Excerpts
Highly Influenced

Degree, grith and chromatic number, in ``Combinatorics, Keszthely 1976'' (A

A. V. Kostochka
Hajnal and V. T. So s, Eds.), Colloq. Math. Soc. Ja nos Bolyai, Vol. 18, pp. 679 696, North-Holland, Amsterdam, • 1978
View 2 Excerpts
Highly Influenced

Maximum matching and a polyhedron with 0, 1-vertices

J. Edmonds
J. Res. Nat. Bur. Standards (B) • 1965
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…