1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.CO2025
Rooted -Minors
Xiying Du, Yanjia Li, Xingxing Yu
Let be a graph and be distinct vertices of . We say has a -minor or has a -minor rooted at , i…
math.CO2025★ 1 cited
Burling graphs in graphs with large chromatic number
Tara Abrishami, Marcin Briański, James Davies +4
A graph class is -bounded if the only way to force large chromatic number in graphs from the class is by forming a large clique. In the 1970s, Erdős conjectured that intersectio…
math.CO2024
A survey of degree-boundedness
Xiying Du, Rose McCarty
Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-bounded…