A combinatorial analysis of Severi degrees

The proof of our linearity result is completely combinatorial. We define τ-graphs which generalize long-edge graphs, and a closely related family of combinatorial objects we call (τ,n)-words. By introducing height functions and a concept of irreducibility, we describe ways to decompose certain families of (τ,n)-words into irreducible words, which leads to the desired results.