We will discuss how a number of important combinatorial invariants and structures in graph theory and integer linear programming can be detected using algebraic methods. We will also see how combinatorial questions and conjectures can be restated in algebraic language.