Geodesic
Graph-Colouring and Combinatorial Numbers
Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 520-534

Voir la notice de l'article provenant de la source Cambridge University Press

We shall use the term n-configuration for the complete graph having n vertices, which we visualize as a regular convex polygon. The sides and diagonals will be referred to as edges. A complete sub-configuration of p vertices (subset of p vertices with all interconnecting edges) will be called a p-tuple. A 3-tuple will be called a triple or triangle, a 4-tuple a quadruple, etc. 
Sobczyk, Andrew. Graph-Colouring and Combinatorial Numbers. Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 520-534. doi: 10.4153/CJM-1968-054-x
@article{10_4153_CJM_1968_054_x,
     author = {Sobczyk, Andrew},
     title = {Graph-Colouring and {Combinatorial} {Numbers}},
     journal = {Canadian journal of mathematics},
     pages = {520--534},
     year = {1968},
     volume = {20},
     number = {1},
     doi = {10.4153/CJM-1968-054-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-054-x/}
}
TY  - JOUR
AU  - Sobczyk, Andrew
TI  - Graph-Colouring and Combinatorial Numbers
JO  - Canadian journal of mathematics
PY  - 1968
SP  - 520
EP  - 534
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-054-x/
DO  - 10.4153/CJM-1968-054-x
ID  - 10_4153_CJM_1968_054_x
ER  - 
%0 Journal Article
%A Sobczyk, Andrew
%T Graph-Colouring and Combinatorial Numbers
%J Canadian journal of mathematics
%D 1968
%P 520-534
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-054-x/
%R 10.4153/CJM-1968-054-x
%F 10_4153_CJM_1968_054_x

[1] 1. Gleason, A. M. and Greenwood, R. E., Combinatorial relations and chromatic graphs, Can. J. Math., 7 (1955), 1–7. Google Scholar

[2] 2. Graver, J. E. and Yackel, J., An upper bound for Ramsey numbers, Bull. Amer. Math. Soc, 72 (1966), 1076–1079. Google Scholar

[3] 3. Hall, Marshall, Jr., “A survey of combinatorial analysis,” in Some aspects of analysis and probability (Wiley, New York, 1958), pp. 35–104. Google Scholar

[4] 4. Kalbfleisch, J. G., Construction of special edge-chromatic graphs, Can. Math. Bull., 8 (1965), 575–584. Google Scholar

[5] 5. Kéry, Gerzson, Ramsey egy grâfelmeleti tételêrôl, Mat. Lapok, 15 (1964), 204–224. Google Scholar

[6] 6. Ryser, H. J., Carus Monograph No. 14, Combinatorial mathematics (Wiley, New York, 1963).10.5948/UPO9781614440147 Google Scholar | DOI

Cité par Sources :