Coloring games and algebraic problems on matroids

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.

PhD thesis in computer science, Jagiellonian University, defended 24 Jan 2014 (updated references)

References in corpus (6)

• On the toric ideal of a matroid
• A generalization of Combinatorial Nullstellensatz
• Constructive degree bounds for group-based models
• Indicated coloring of matroids
• Measurable patterns, necklaces, and sets indiscernible by measure
• f-vectors implying vertex decomposability

Cited by in corpus (1)

• On the Structure of the Graph of Unique Symmetric Base Exchanges of Bispanning Graphs