… random graphs, and conjectures that the indicated chromatic number of a graph is bounded
… the indicated coloring game for matroids. In Theorem 1 we prove that for matroids indicated …

… If Ann has a strategy guaranteeing that she achieves her goal, then we say that the system
M1,M2,...,Mt has a cooperative indicated coloring. Using the result of Lasoń [6] and our …

… We say that matroid M is colorable from the lists L if there exists a proper coloring of M ,
such that each element receives a color from its list. The list … Indicated coloring of matroids …

… To achieve our goal we shall need a more general version of the matroid coloring game. Let
M 1 , … , M d be matroids on the same ground set E , and let { … Indicated coloring of matroids …

… are called matroid complexes. It is one of the first facts of matroid theory that a matroid complex
is … We will list the 8 bases of M in lexicographic order, and indicate for each basis which …

… of matroids and now provides a framework for the invariant theory of sets of points. The
abstraction of the coloring … In Figure 1.1c we indicate one such choice of six points. Here, for …

… We review the theory of submodular functions and matroids in Chapters 1 and 2 respectively.
In Chapter 3 we consider the problem of given two matroids M1 and M2, find the smallest …

… Z Figures in brackets indicate the references at the end of this … coloring problem for the
independent sets of a matroid. Another paper will treat the weighted packing problem for matroids. …

… We consider a coloring of a matroid from lists, but in a situation when only a part of information
about colors in the lists is known. This situation can be … Indicated coloring of matroids …

… matroids that are uniform or whose rank is at most three. Considering coflows, we prove that
the worst case scenario in coloring … general context of oriented matroid coflows. Chapter 4 is …