6 research outputs found
Colorings of complements of line graphs
Our purpose is to show that complements of line graphs enjoy nice coloring
properties. We show that for all graphs in this class the local and usual
chromatic numbers are equal. We also prove a sufficient condition for the
chromatic number to be equal to a natural upper bound. A consequence of this
latter condition is a complete characterization of all induced subgraphs of the
Kneser graph that have a chromatic number equal to its
chromatic number, namely . In addition to the upper bound, a lower bound
is provided by Dol'nikov's theorem, a classical result of the topological
method in graph theory. We prove the -hardness of deciding
the equality between the chromatic number and any of these bounds.
The topological method is especially suitable for the study of coloring
properties of complements of line graphs of hypergraphs. Nevertheless, all
proofs in this paper are elementary and we also provide a short discussion on
the ability for the topological methods to cover some of our results
Multilabeled versions of Sperner's and Fan's lemmas and applications
We propose a general technique related to the polytopal Sperner lemma for
proving old and new multilabeled versions of Sperner's lemma. A notable
application of this technique yields a cake-cutting theorem where the number of
players and the number of pieces can be independently chosen. We also prove
multilabeled versions of Fan's lemma, a combinatorial analogue of the
Borsuk-Ulam theorem, and exhibit applications to fair division and graph
coloring.Comment: 21 pages, 2 figure