论文信息 - Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number

Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number

We present some nice properties of the classical construction of triangle-free graphs with high chromatic number given by Blanche Descartes and its modifications. In particular, we construct colour-critical graphs and hypergraphs of high girth with moderate average degree.

Alexandr V. Kostochka | Jaroslav Nesetril | J. Nesetril | A. Kostochka

[1] Bing Zhou,et al. Color-critical graphs and hypergraphs with few edges and no short cycles , 1998, Discrete Mathematics.

[2] Bjarne Toft,et al. Color-critical graphs and hypergraphs☆ , 1974 .

[3] H. L. Abbott,et al. Sparse color-critical hypergraphs , 1989, Comb..

[4] P. Erdos,et al. On chromatic number of graphs and set-systems , 1966 .

[5] Igor Kríz,et al. Ahypergraph-free construction of highly chromatic graphs without short cycles , 1989, Comb..

[6] Jaroslav Nešetřil. AMALGAMATION OF GRAPHS AND ITS APPLICATIONS , 1979 .

[7] W. Schmidt. IRREGULARITIES OF DISTRIBUTION (Cambridge Tracts in Mathematics 89) , 1988 .

[8] P. Seymour. ON THE TWO-COLOURING OF HYPERGRAPHS , 1974 .

[9] Dinoj Surendran,et al. The three colour problem , 1999 .

[10] Alexandr V. Kostochka,et al. On the Number of Edges in Colour-Critical Graphs and Hypergraphs , 2000, Comb..

[11] Oleg V. Borodin,et al. Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces , 1993 .

[12] Bing Zhou,et al. Sparse color-critical graphs and hypergraphs with no short cycles , 1994, J. Graph Theory.