论文信息 - The minimum number of vertices for a triangle-free graph with chil(G)=4 is 11

The minimum number of vertices for a triangle-free graph with chil(G)=4 is 11

It is well-known that the minimum number of vertices for a triangle-free 4-chromatic graph is 11, and the Grotzsch graph is just such a graph. In this paper, we show that every non-bipartite triangle-free graph G of order not greater than 10 has @g"l(G)=3. Combined with a known result by Hanson et al. [D. Hanson, G. MacGillivray, B. Toft, Choosability of bipartite graphs, Ars Combin. 44 (1996) 183-192] that every bipartite graph of order not greater than 13 is 3-choosable, we conclude that the minimum number of vertices for a triangle-free graph with @g"l(G)=4 is also 11.

Li Zhang | Baoyindureng Wu | B. Wu | Li Zhang

[1] Shai Gutner,et al. The complexity of planar graph choosability , 1996, Discret. Math..

[2] Sylvain Gravier,et al. Graphs whose choice number is equal to their chromatic number , 1998 .

[3] Gordon F. Royle,et al. Small graphs with chromatic number 5: A computer search , 1995, J. Graph Theory.

[4] Gary MacGillivray,et al. Choosability of bipartite graphs , 1996, Ars Comb..

[5] Stephan Brandt,et al. On the Structure of Dense Triangle-Free Graphs , 1999, Combinatorics, Probability and Computing.

[6] Bruce A. Reed. The list colouring constants , 1999, J. Graph Theory.

[7] Jan Mycielski. Sur le coloriage des graphs , 1955 .