Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-15T17:49:45.904Z Has data issue: false hasContentIssue false
  • English
  • Français

Graph-Colouring and Combinatorial Numbers

Published online by Cambridge University Press:  20 November 2018

Andrew Sobczyk
Andrew Sobczyk*
Affiliation:
Clemson University, Clemson, S.C.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 20 , 1968 , pp. 520 - 534
Copyright
Copyright © Canadian Mathematical Society 1968

Footnotes

This research was partially sponsored by National Science Foundation Grant GP-3909.

References

1. Gleason, A. M. and Greenwood, R. E., Combinatorial relations and chromatic graphs, Can. J. Math., 7 (1955), 1–7.Google Scholar
2. Graver, J. E. and Yackel, J., An upper bound for Ramsey numbers, Bull. Amer. Math. Soc, 72 (1966), 1076–1079.Google Scholar
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. Kalbfleisch, J. G., Construction of special edge-chromatic graphs, Can. Math. Bull., 8 (1965), 575–584.Google Scholar
5. Kéry, Gerzson, Ramsey egy grâfelmeleti tételêrôl, Mat. Lapok, 15 (1964), 204–224.Google Scholar
6. Ryser, H. J., Carus Monograph No. 14, Combinatorial mathematics (Wiley, New York, 1963).10.5948/UPO9781614440147CrossRefGoogle Scholar