Editorial
p. i-ii
Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
p. 1-19
The Overfull Nine Dragon Tree Conjecture is True
p. 21-32
A note on matching variables to equations
p. 33-38
Powers of planar graphs, product structure, and blocking partitions
p. 39-86
Shallow vertex minors, stability, and dependence
p. 87-112