titre: On Tutte polynomials of graphs and matroids ------ Resume: ------- Tutte polynomials can be defined for graphs or more generally for matroids, and they generalize the well-known chromatic polynomials. They play an important role in seemingly unrelated areas, like knot theory, statistical mechanics, hyperplane arrangements, coding theory, network reliability, and others. The talk will be a gentle introduction to the basic concepts of matroid theory and Tutte polynomials. Some recent results will be discussed, particularly the question of to which extent the Tutte polynomial captures properties of the corresponding matroid or graph and, in some special cases, characterizes it up to isomorphism.