A Polynomial Erd s-P'osa bound for Eulerian digraphs
cs.DM, cs.DS, math.CO
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
Related papers
- Low-Temperature Sampling via Equilibrium Disagreements
- An Improved Bound for Testing k-Colorability
- Temporal Cliques Admit Linear Spanners
- Multiway Partition is FPT for Connectivity Functions
- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
- Constrained intersection representations and forbidden patterns