Coloring games and algebraic problems on matroids
Combinatorics
2017-10-03 v2 Commutative Algebra
Algebraic Geometry
Abstract
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.
Cite
@article{arxiv.1501.00224,
title = {Coloring games and algebraic problems on matroids},
author = {Michał Lasoń},
journal= {arXiv preprint arXiv:1501.00224},
year = {2017}
}
Comments
PhD thesis in computer science, Jagiellonian University, defended 24 Jan 2014 (updated references)