Subcubic graphs of large treewidth do not have the edge-Erdos-P\'osa property
Abstract
We show that subcubic graphs of treewidth at least 2500 do not have the edge-Erdos-P\'osa property.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.