English

Sectionable Tournaments: Their topology and Coloring

Combinatorics 2022-12-20 v2

Abstract

We provide a detailed study of topological and combinatorial properties of sectionable tournaments. This class forms an inductively constructed family of tournaments grounded over simply disconnected tournaments, those tournaments whose fundamental groups of acyclic complexes are non-trivial. When TT is a sectionable tournament, we fully describe the cell-structure of its acyclic complex Acy(T)Acy(T) by using the adapted machinery of discrete Morse theory for acyclic complexes of tournaments. In the combinatorial side, we demonstrate that the dimension of the complex Acy(T)Acy(T) has a role to play. We prove that if TT is a (2r+1)(2r+1)-sectionable tournament and dd is the dimension of Acy(T)Acy(T), then the (acyclic) chromatic number of TT satisfies χ(T)2(21/(r+1))log(d+1)1\chi(T)\leq 2 \left( 2-1/(r+1) \right)^{\log(d+1)}-1 where the logarithm has two as its base.

Keywords

Cite

@article{arxiv.2104.05839,
  title  = {Sectionable Tournaments: Their topology and Coloring},
  author = {Zakir Deniz},
  journal= {arXiv preprint arXiv:2104.05839},
  year   = {2022}
}

Comments

21 pages

R2 v1 2026-06-24T01:06:05.806Z