A note on almost disjoint families
HTML articles powered by AMS MathViewer
- by Péter Komjáth PDF
- Proc. Amer. Math. Soc. 137 (2009), 303-305 Request permission
Abstract:
We give a short proof of the existence of arbitrarily large chromatic almost disjoint systems. With the same method we solve a problem of P. Szeptycki.References
- G. Elekes and G. Hoffmann, On the chromatic number of almost disjoint families of countable sets, Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. I, Colloq. Math. Soc. János Bolyai, Vol. 10, North-Holland, Amsterdam, 1975, pp. 397–402. MR 0373905
- P. Erdős and A. Hajnal, On a property of families of sets, Acta Math. Acad. Sci. Hungar. 12 (1961), 87–123 (English, with Russian summary). MR 150047, DOI 10.1007/BF02066676
- P. Komjáth, Dense systems of almost-disjoint sets, Finite and infinite sets, Vol. I, II (Eger, 1981) Colloq. Math. Soc. János Bolyai, vol. 37, North-Holland, Amsterdam, 1984, pp. 527–536. MR 818255
- Paul J. Szeptycki, Transversals for strongly almost disjoint families, Proc. Amer. Math. Soc. 135 (2007), no. 7, 2273–2282. MR 2299505, DOI 10.1090/S0002-9939-07-08714-X
Additional Information
- Péter Komjáth
- Affiliation: Department of Computer Science, Eötvös University, P. O. Box 120, Budapest, 1518, Hungary
- MR Author ID: 104465
- Email: kope@cs.elte.hu
- Received by editor(s): November 20, 2007
- Published electronically: July 8, 2008
- Additional Notes: This research was partially supported by Hungarian National Research Grant T 046991.
- Communicated by: Julia Knight
- © Copyright 2008
American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication. - Journal: Proc. Amer. Math. Soc. 137 (2009), 303-305
- MSC (2000): Primary 03E05
- DOI: https://doi.org/10.1090/S0002-9939-08-09527-0
- MathSciNet review: 2439454