Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphes et Hypergraphes, Dunod, Paris, 1970
B. Lindström, A Theorem on families of Sets, J. of Combinatorial Theory, A. 13, 1972, 274–277.
P. Erdös, Chao Ko, R. Rado, Intersection theorems for systems of finite sets, Quart. J. of Math. (Oxford) (2) 12 (1961), 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. Working Seminar on Hypergraphs, Columbus Ohio (1972), Springer-Verlag.
R.P. Gupta, A decomposition theorem for binartite graphs, Théorie des graphes, Romme I.C.C. (P. Rosenstiel ed.), Dunod, Paris, 1967, 135–138.
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag
About this paper
Cite this paper
Berge, C. (1974). Nombres de coloration de l’hypergraphe h-parti complet. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066175
Download citation
DOI: https://doi.org/10.1007/BFb0066175
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06846-4
Online ISBN: 978-3-540-37803-7
eBook Packages: Springer Book Archive