We define "q-cut" and "q-flow" lattices associated to a finite graph, arising from a categorification construction for the lattices of integer cuts and flows (which we'll introduce in the talk). We'll describe combinatorial properties of these invariants, including categorified/q-versions of some classical theorems in graph theory. Based on joint work with Tony Licata.