The Coarseness of the Complete Graph
Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 888-894
Voir la notice de l'article provenant de la source Cambridge University Press
The coarseness, c(G), of a graph G is the maximum number of edge-disjoint, non-planar subgraphs of G. We consider only the complete graph, Kp , on p vertices here. For p = 3r, Erdös conjectured that the coarseness was , but it has been shown (1) that 1 where square brackets denote integer part.
Guy, Richard K.; Beineke, Lowell W. The Coarseness of the Complete Graph. Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 888-894. doi: 10.4153/CJM-1968-085-6
@article{10_4153_CJM_1968_085_6,
author = {Guy, Richard K. and Beineke, Lowell W.},
title = {The {Coarseness} of the {Complete} {Graph}},
journal = {Canadian journal of mathematics},
pages = {888--894},
year = {1968},
volume = {20},
number = {1},
doi = {10.4153/CJM-1968-085-6},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-085-6/}
}
TY - JOUR AU - Guy, Richard K. AU - Beineke, Lowell W. TI - The Coarseness of the Complete Graph JO - Canadian journal of mathematics PY - 1968 SP - 888 EP - 894 VL - 20 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-085-6/ DO - 10.4153/CJM-1968-085-6 ID - 10_4153_CJM_1968_085_6 ER -
[1] 1. Guy, Richard K., A coarseness conjecture of Erdôs, J. Combinatorial Theory 3 (1967), 38–42. Google Scholar
[2] 2. Kuratowski, Kasimir, Sur le problème des courbes gauches en topologie, Fund. Math. 15 1930), 271–283. Google Scholar
[3] 3. Rosa, A., On certain valuations of the vertices of a graph, Théorie des graphes, journées internationales d'étude, Rome, 1966 (Dunod, Paris, 1967), 349–355. Google Scholar
Cité par Sources :