On the chromatic number of some geometric type Kneser graphs

Computational Geometry: Theory and Applications

Volumn 32, Issue 1, 2005, Pages 59-69

  Araujo, G ^a   Dumitrescu, A ^b   Hurtado, F ^c   Noy, M ^c   Urrutia, J ^a  

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

^b University of Wisconsin Milwaukee   (United States)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Geometric graphs; Kneser graphs; Pairwise crossing edges; Pairwise disjoint edges

Indexed keywords

EID: 84867974067     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.10.003     Document Type: Article

References (13)

1. I. Bárány A short proof of Kneser's conjecture J. Combin. Theor. Ser. A 25 1978 325 326
2. H. Hopf, and E. Pannwitz Aufgabe No. 167 Jahresbericht der Deutschen Mathematiker-Vereinigung 43 1934 114
3. T.J. Jensen, and B. Toft Graph Coloring Problems 1995 Wiley New York
4. G. Károlyi, J. Pach, and G. Tóth Ramsey-type results for geometric graphs. I Discrete Comput. Geom. 18 1997 247 255
5. M. Kneser Aufgabe No. 360 Jahresbericht der Deutschen Mathematiker-Vereinigung 58 2. Abteilung 1955 27
6. A. Kostochka, and J. Kratochvíl Covering and coloring polygon-circle graphs Discrete Math. 163 1997 299 305
7. Y. Kupitz Extremal Problems in Combinatorial Geometry Aarhus University Lecture Notes Series vol. 53 1979 Aarhus University Denmark
8. L. Lovász Kneser's conjecture, chromatic number, and homotopy J. Combin. Theor. Ser. A 25 1978 319 324
9. J. Matoušek, A combinatorial proof of Kneser's conjecture, Combinatorica, submitted for publication
10. J. Pach, and P.K. Agarwal Combinatorial Geometry 1995 Wiley New York
11. J. Pach, and J. Törcsik Some geometric applications of Dilworth's theorem Discrete Comput. Geom. 12 1994 1 7
12. G. Tóth Note on geometric graphs J. Combin. Theor. Ser. A 89 2000 126 132
13. G. Tóth, and P. Valtr Geometric graphs with few disjoint edges Discrete Comput. Geom. 22 1999 633 642