Easier proofs of coloring theorems

被引:8
|
作者
van Mill, J [1 ]
机构
[1] Vrije Univ Amsterdam, Fac Wiskunde Informat, NL-1081 HV Amsterdam, Netherlands
关键词
color of a map; paracompact; n-dimensional;
D O I
10.1016/S0166-8641(98)00114-X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We present a simpler proof of the known theorem that a fixed-point free homeomorphism on an n-dimensional paracompact space can be colored with n + 3 colors. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:155 / 163
页数:9
相关论文
共 50 条
  • [1] Bijective Proofs of Proper Coloring Theorems
    Sagan, Bruce
    Vatter, Vincent
    [J]. AMERICAN MATHEMATICAL MONTHLY, 2021, 128 (06): : 483 - 499
  • [2] Generalized Kneser coloring theorems with combinatorial proofs
    Günter M. Ziegler
    [J]. Inventiones mathematicae, 2002, 147 : 671 - 691
  • [3] Short proofs of coloring theorems on planar graphs
    Borodin, Oleg V.
    Kostochka, Alexandr V.
    Lidicky, Bernard
    Yancey, Matthew
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2014, 36 : 314 - 321
  • [4] Generalized Kneser coloring theorems with combinatorial proofs
    Ziegler, GM
    [J]. INVENTIONES MATHEMATICAE, 2002, 147 (03) : 671 - 691
  • [5] Generalized Kneser coloring theorems with combinatorial proofs
    Günter M. Ziegler
    [J]. Inventiones mathematicae, 2006, 163 : 227 - 228
  • [6] Generalized Kneser coloring theorems with combinatorial proofs (vol 147, pg 671, 2002)
    Ziegler, GM
    [J]. INVENTIONES MATHEMATICAE, 2006, 163 (01) : 227 - 228
  • [7] Invalid proofs on incidence coloring
    Shiu, W. C.
    Sun, P. K.
    [J]. DISCRETE MATHEMATICS, 2008, 308 (24) : 6575 - 6580
  • [8] Three Sylow Theorems and Their Proofs
    Li, Dezheng
    [J]. 2ND INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS, MODELLING, AND INTELLIGENT COMPUTING (CAMMIC 2022), 2022, 12259
  • [9] Proofs of lemmas and theorems in the UTP
    [J]. REFINEMENT TECHNIQUES IN SOFTWARE ENGINEERING, 2006, 3167 : 369 - 374
  • [10] SHORT THEOREMS WITH LONG PROOFS
    SPENCER, J
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1983, 90 (06): : 365 - 366