This is a preview of subscription content, log in via an institution to check access.
References
P. Erdős andA. Hajnal, On chromatic number of graphs and set-systems,Acta Math. Acad. Sci. Hung.,17 (1966), pp. 61–99.
P. Erdős andR. Rado, A partition calculus in set theory,Bulletin of Am. Math. Soc.,62 (1956), pp. 427–489.
P. Erdős, A. Hajnal andR. Rado, Partition relations for cardinal numbers,Acta Math. Acad. Sci. Hung.,16 (1965), pp. 93–196.
P. Erdős andR. Rado, A construction of graphs without triangles having pre-assigned order and chromatic number,The Journal of the London Math. Soc.,35 (1960), pp. 445–448.
P. Erdős, Graph theory and probability,Canad. J. Math.,11 (1959), pp. 34–38.
P. Erdős andA. Rogers, The construction of certain graphs,Canadian Math. Journal,14 (1962), pp. 702–707.
E. Specker, Teilmengen von Mengen mit Relationen,Commentarii Math. Helvetici,31 (1957), pp. 302–334.
Nash Williams, Decomposition of finite graphs into forests,Journal of the London Math. Soc.,39 (1964), p. 12.
C. Berge,Théorie des graphes et ses applications (Dunod, Paris, 1958).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Erdős, P., Hajnal, A. On decomposition of graphs. Acta Mathematica Academiae Scientiarum Hungaricae 18, 359–377 (1967). https://doi.org/10.1007/BF02280296
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02280296