Coloring games and algebraic problems on matroids
Michał Lasoń · arXiv (Cornell University) · 2015
This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with combinatorial, algebraic, and topological flavor.