A new Ramsey-type theorem for 2-edge-colored graphs with high minimum degree implies preservation of degree-boundedness under extensions and exactly characterizes oriented forbidden subgraphs F for degree-bounded classes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Edge-colouring and orientations: applications to degree- and $\chi$-boundedness
A new Ramsey-type theorem for 2-edge-colored graphs with high minimum degree implies preservation of degree-boundedness under extensions and exactly characterizes oriented forbidden subgraphs F for degree-bounded classes.