Large digraphs meeting robust degree sequence conditions are (N H)-linked for any H and admit perfect H-subdivision tilings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The $H$-linkage problems in sparse robustly expanding digraphs
Large digraphs meeting robust degree sequence conditions are (N H)-linked for any H and admit perfect H-subdivision tilings.