论文信息 - The crossing number of K11 is 100

The crossing number of K11 is 100

The crossing number of Kn is known for n ⩽ 10. We develop several simple counting properties that we shall exploit in showing by computer that cr(K11 = 100, which implies that cr(K12) = 150. We also determine the numbers of non-isomorphic optimal drawings of K9 and K10. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 128–134, 2007

Shengjun Pan | R. Bruce Richter | Shengjun Pan | R. Bruce Richter

[1] Reinhard Diestel,et al. Graph Theory , 1997 .

[2] R. Bruce Richter,et al. RELATIONS BETWEEN CROSSING NUMBERS OF COMPLETE AND COMPLETE BIPARTITE GRAPHS , 1997 .

[3] Alexander Schrijver,et al. Reduction of symmetric semidefinite programs using the regular $$\ast$$-representation , 2007, Math. Program..

[4] Daniel J. Kleitman. A note on the parity of the number of crossings of a graph , 1976, J. Comb. Theory, Ser. B.

[5] Stephane Durocher,et al. The Rectilinear Crossing Number of K10 is 62 , 2000, Electron. J. Comb..

[6] Carsten Thomassen,et al. Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[7] K. Brown,et al. Graduate Texts in Mathematics , 1982 .

[8] R. Guy. Crossing numbers of graphs , 1972 .