Abstract
It is consistent that there exists an uncountably chromatic triple system which does not contain two triples with two common points or circuits of lengths 3, 5.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Erdős, Graph theory and probability, Canad. Journ. Math., 11 (1959), 34–38.
P. Erdős, F. Galvin and A. Hajnal, On set systems having large chromatic number and not containing prescribed subsystems, Colloq. Math. Soc. J. Bolyai, 10 (1975), 425–513.
P. Erdős and A. Hajnal, On chromatic number of graphs and set-systems, Acta Math. Acad. Sci. Hung., 17 (1966), 61–99.
P. Erdős, A. Hajnal and B. Rothschild, On chromatic number of graphs and set systems, Cambridge Summer Schol in Mathematical Logic, Lecture Notes in Mathematics, 337 (1973), 531–538.
P. Erdős and R. Rado, A partition calculus in set theory, Bull. Amer. Math. Soc., 62 (1956), 427–489.
P. Erdős and R. Rado, Partition relations connected with chromatic number of graphs, Journal of London Math. Soc., 34 (1959), 63–72.
A. Hajnal, On the chromatic number of graphs and set systems, PIMS Distinguished Chair Lecture Notes, 2004. http://www.math.rutgers.edu/:_ahajnal/_notes.pdf
A. Hajnal and P. Komjáth, Obligatory subsystems of triple systems, Acta Math. Hungar., 119 (2008), 1–13.
P. Komjáth, Some remarks on obligatory subsystems of uncountably chromatic triple systems, Combinatorica, 21 (2001), 233–238.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by Hungarian National Research Grant T 046991.
Rights and permissions
About this article
Cite this article
Komjáth, P. An uncountably chromatic triple system. Acta Math Hung 121, 79–92 (2008). https://doi.org/10.1007/s10474-008-7179-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-008-7179-6