R. Aharoni and E. Berger, The intersection of a matroid and a simplicial complex, Trans. Amer. Math. Soc, vol.358, issue.11, pp.4895-4917, 2006.

R. Aharoni, E. Berger, and R. Ziv, Independent systems of representatives in weighted graphs, Combinatorica, vol.27, issue.3, pp.253-267, 2007.

R. Aharoni, R. Holzman, D. Howard, and P. Sprüssel, Cooperative colorings and independent systems of representatives, Electron. J. Combin, vol.22, issue.2, 2015.

N. Alon and M. Krivelevich, The choice number of random bipartite graphs, Ann. Comb, vol.2, issue.4, pp.291-297, 1998.

O. Amini and B. Reed, List colouring constants of triangle free graphs, The IV Latin-American Algorithms, Graphs, and Optimization Symposium, vol.30, pp.135-140, 2008.

N. Alon and J. H. Spencer, The probabilistic method. Wiley Series in Discrete Mathematics and Optimization, vol.25, p.0, 2016.

J. Edmonds, Submodular functions, matroids, and certain polyhedra, Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), pp.69-87, 1970.

P. E. Haxell, A note on vertex list colouring, Combin. Probab. Comput, vol.10, issue.4, pp.345-347, 2001.

L. Lovász and M. D. Plummer, Matching theory, North-Holland Mathematics Studies, vol.121, p.29, 1986.

B. Po-shen-loh and . Sudakov, Independent transversals in locally sparse graphs, J. Combin. Theory Ser. B, vol.97, issue.6, pp.904-918, 2007.

R. Meshulam, The clique complex and hypergraph matching, the electronic journal of combinatorics, vol.21, issue.1, p.0, 2001.