论文信息 - Reorientations of covering graphs

Reorientations of covering graphs

Abstract The aim of this paper is to construct a graph G on n vertices which is a connected covering graph but has 2 o(n) diagram orientations. This provides a negative answer to a question of I. Rival.

Jaroslav Nesetril | Graham R. Brightwell

[1] P. Erdös,et al. Graph Theory and Probability , 1959 .

[2] Béla Bollobás,et al. Random graphs and covering graphs of posets , 1986 .

[3] Vojtěch Rödl,et al. Combinatorial partitions of finite posets and lattices —Ramsey lattices , 1984 .

[4] Vojtěch Rödl,et al. Complexity of diagrams , 1987 .

[5] Vojtěch Rödl,et al. On a probabilistic graph-theoretical method , 1978 .