References
- [1] Paul Erdős and András Hajnal, Some remarks on set theory. IX. Combinatorial problems in measure theory and set theory, Michigan Math. J. 11 (2), 107–127, 1964.
- [2] David Larman, Jiří Matoušek, János Pach, and Jenő Törőcsik, A Ramsey-type result for convex sets, Bull. London Math. Soc. 26 (2), 132–136, 1994.
- [3] Sean McGuinness, Colouring arcwise connected sets in the plane I, Graphs Comb. 16 (4), 429–439, 2000.
- [4] Matthias Middendorf and Frank Pfeiffer, The max clique problem in classes of string-graphs, Discrete Math. 108 (1–3), 365–372, 1992.
- [5] János Pach, Gábor Tardos, and Géza Tóth, Disjointness graphs of segments, in: Boris Aronov and Matthew J. Katz (eds.), 33rd International Symposium on Computational Geometry (SoCG 2017), vol. 77 of Leibniz International Proceedings in Informatics (LIPIcs), 59:1–15, Leibniz-Zentrum für Informatik, Dagstuhl, 2017.
- [6] Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, and Bartosz Walczak, Triangle-free intersection graphs of line segments with large chromatic number, J. Comb. Theory Ser. B 105, 6–10, 2014.
Comments
There are no comments yet.