Much of the work of Jiří Matoušek, his papers and books include fascinating applications of tools from linear algebra and topology in the investigation of combinatorial problems and in the study of their algorithmic aspects. In the tradition of his work I will describe several recent and less recent applications of topological and algebraic methods in the derivation of combinatorial results. In all of them the proofs provide no efficient solutions for the corresponding algorithmic problems.