Xiying Du

activity

20232025

C_{4}

-free subgraphs with large average degree

2 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2025

Rooted $C_{5}$ -Minors

Xiying Du, Yanjia Li, Xingxing Yu

Let $G$ be a graph and $x_{1}, x_{2}, \dots, x_{k}$ be distinct vertices of $G$ . We say $(G, x_{1} x_{2} \dots x_{k})$ has a $C_{k}$ -minor or $G$ has a $C_{k}$ -minor rooted at $x_{1} x_{2} \dots x_{k}$ , 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…

math.CO2023★ 2 cited

Induced $C_{4}$ -free subgraphs with large average degree

Xiying Du, António Girão, Zach Hunter +2

We prove that there exists a constant $C$ so that, for all $s, k \in N$ , if $G$ has average degree at least $k^{C s^{3}}$ and does not contain $K_{s, s}$ as a subgraph then it…

math.CO2023

Linkages and removable paths avoiding vertices

Xiying Du, Yanjia Li, Shijie Xie +1

We say that a graph $G$ is $(2, m)$ -linked if, for any distinct vertices $a_{1}, \dots, a_{m}, b_{1}, b_{2}$ in $G$ , there exist vertex disjoint connected subgraphs $A, B$ of $G$ such that $\…