383 research outputs found

    On topological relaxations of chromatic conjectures

    Get PDF
    There are several famous unsolved conjectures about the chromatic number that were relaxed and already proven to hold for the fractional chromatic number. We discuss similar relaxations for the topological lower bound(s) of the chromatic number. In particular, we prove that such a relaxed version is true for the Behzad-Vizing conjecture and also discuss the conjectures of Hedetniemi and of Hadwiger from this point of view. For the latter, a similar statement was already proven in an earlier paper of the first author with G. Tardos, our main concern here is that the so-called odd Hadwiger conjecture looks much more difficult in this respect. We prove that the statement of the odd Hadwiger conjecture holds for large enough Kneser graphs and Schrijver graphs of any fixed chromatic number

    Colorful Borsuk--Ulam theorems and applications

    Full text link
    We prove a colorful generalization of the Borsuk--Ulam theorem and derive colorful consequences from it, such as a colorful generalization of the ham sandwich theorem. Even in the uncolored case this specializes to a strengthening of the ham sandwich theorem, which given an additional condition, contains a result of B\'{a}r\'{a}ny, Hubard, and Jer\'{o}nimo on well-separated measures as a special case. We prove a colorful generalization of Fan's antipodal sphere covering theorem, we derive a short proof of Gale's colorful KKM theorem, and we prove a colorful generalization of Brouwer's fixed point theorem. Our results also provide an alternative between Radon-type intersection results and KKM-type covering results. Finally, we prove colorful Borsuk--Ulam theorems for higher symmetry.Comment: 15 page
    • …
    corecore