Summary
The chromatic index, the transversal number, the clique number, etc., have all been extensively studied in Graph Theory, and can be easily extended to Hypergraphs. The author determines these coefficients for the complete multipartite hypergraphs, which g,neralize the complete bipartite graphs, and appear also in the Theory of Designs.
Article PDF
Similar content being viewed by others
References
C. Berge,Graphes et Hypergraphes, Dund, Paris, 1970.
B. Lindström,A Theorem on families of Sets, J. of Combinatorial Theory, A13 (1972), pp. 274–277.
P. Erdös —Chao Ko —R. Rado,Intersection theorems for systems of finite sets, Quart. J. of Math. (Oxford), (2),12 (1961), pp. 313–320.
E. Lucas,Récréations Mathématiques, A. Blanchard, Paris, 1892–1924.
R. Peltesohn,Das Turnier Problem für Spiele zu je dreier, Inaugural Dissertation, Friedrich-Wilhelms-Universitαt zu Berlin, 1936.
J. C. Meyer,Quelques problèmes concernant les cliques des hypergraphes h-complets et q-parti h-complets, Hypergraph Seminar (à paraitre), Springer-Verlag.
R. P. Gupta,A decomposition theorem for bipartite graphs, Théorie des graphes, Rome I.C.C. (P. Rosenstiel ed.), Dunod, Paris, 1967, pp. 135–138.
Author information
Authors and Affiliations
Additional information
Entrata in Redazione il 16 maggio 1973.
Rights and permissions
About this article
Cite this article
Berge, C. Nombres de coloration de l'hypergrapheh-parti complet. Annali di Matematica 103, 3–9 (1975). https://doi.org/10.1007/BF02414141
Issue Date:
DOI: https://doi.org/10.1007/BF02414141