5 research outputs found
The chromatic number of almost stable Kneser hypergraphs
Let be the set of -subsets of such that for all
, we have We define almost -stable Kneser hypergraph
to be the
-uniform hypergraph whose vertex set is and whose edges are the
-uples of disjoint elements of .
With the help of a -Tucker lemma, we prove that, for prime and for
any , the chromatic number of almost 2-stable Kneser hypergraphs
is equal
to the chromatic number of the usual Kneser hypergraphs ,
namely that it is equal to
Defining to be the number of prime divisors of , counted with
multiplicities, this result implies that the chromatic number of almost
-stable Kneser hypergraphs is equal to the
chromatic number of the usual Kneser hypergraphs for any
, namely that it is equal to $\lceil\frac{n-(k-1)r}{r-1}\rceil.
Fan's lemma via bistellar moves
Pachner proved that all closed combinatorially equivalent combinatorial
manifolds can be transformed into each other by a finite sequence of bistellar
moves. We prove an analogue of Pachner's theorem for combinatorial manifolds
with a free Z2-action, and use it to give a combinatorial proof of Fan's lemma
about labellings of centrally symmetric triangulations of spheres. Similarly to
other combinatorial proofs, we must assume an additional property of the
triangulation for the proof to work. However, unlike the other combinatorial
proofs, no such assumption is needed for dimensions at most 3
Combinatorial Stokes formulae
International audienc