Sectionable tournaments: their topology and coloring
From MaRDI portal
Publication:6139856
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 is a sectionable tournament, we fully describe the cell-structure of its acyclic complex 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 has a role to play. We prove that if is a -sectionable tournament and is the dimension of , then the (acyclic) chromatic number of satisfies where the logarithm has two as its base.
Recommendations
Cites work
- scientific article; zbMATH DE number 4170934 (Why is no real title available?)
- scientific article; zbMATH DE number 4035865 (Why is no real title available?)
- A user's guide to discrete Morse theory
- Efficient data structure for representing and simplifying simplicial complexes in high dimensions
- Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs
- Morse theory for cell complexes
- On the complete digraphs which are simply disconnected
- On the independence complex of square grids
- Simplicial complexes of graphs
- The topology of the independence complex
- Topology of acyclic complexes of tournaments and coloring
This page was built for publication: Sectionable tournaments: their topology and coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139856)