Yiming Hao

activity

20242026

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

Note on near-spanning balanced antidirected trees missing from regular tournaments

Gregory Gutin, Yiming Hao

We construct near-spanning balanced antidirected trees that fail to embed in highly symmetric tournaments despite the conjectured semidegree condition being satisfied. More precise…

math.CO2026

A linear bound for nested cycles without geometric crossings

Jiangdong Ai, Gregory Gutin, Yiming Hao

Cycles $C_{1}, \dots, C_{k}$ in a graph are called nested without geometric crossings if they are pairwise edge-disjoint, $V (C_{k}) \subseteq \dots \subseteq V (C_{1})$ , and each pair of conse…

math.CO2026

Bounds on Odd and Odd-Even Induced Subgraphs

Qiwen Guo, Gregory Gutin, Yiming Hao +3

Let $G$ be an $n$ -vertex graph and let $ℓ : V (G) \to F_{2}$ prescribe degree parities. A set $S \subseteq V (G)$ is $ℓ$ -admissible if every $v \in S$ has degree congruent to…

math.CO2026

Weighted Counting Formula and $2 n /21$ Lower Bound for Induced Subgraphs with Prescribed Degree Parities

Gregory Gutin, Yiming Hao, Yacong Zhou

Let $G = (V, E)$ be a finite simple graph of order $n \geq 1$ , and let $ℓ : V \to {0, 1}$ be a prescribed parity labeling. A set $S \subseteq V$ is called $ℓ$ -admissible if $d_S(v)\e…

Note on near-spanning balanced antidirected trees missing from regular tournaments

A linear bound for nested cycles without geometric crossings

Bounds on Odd and Odd-Even Induced Subgraphs

Weighted Counting Formula and 2n/21 Lower Bound for Induced Subgraphs with Prescribed Degree Parities

Weighted Counting Formula and $2 n /21$ Lower Bound for Induced Subgraphs with Prescribed Degree Parities