Yiming Hao

activity

20242026

collaborators

Showing math.COShow all

6 papers · 1 filter

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…

math.CO2025

Odd Induced Subgraphs in Graphs of Maximum Degree Four

Jiangdong Ai, Qiwen Guo, Gregory Gutin +2

A graph is called odd if all of its vertex degrees are odd. A long-standing conjecture asked whether there exists a positive constant $c$ such that every $n$ -vertex graph without i…

math.CO2025

Large induced subgraphs with prescribed degree parity

Jiangdong Ai, Qiwen Guo, Gregory Gutin +2

A long-standing conjecture of Caro (Discrete Math, 1994), confirmed by Ferber and Krivelevich (Adv Math, 2022), states that every $n$ -vertex graph $G$ without isolated vertices con…

math.CO2024

Arc-disjoint in- and out-branchings in semicomplete split digraphs

Jiangdong Ai, Yiming Hao, Zhaoxiang Li +1

An \emph{out-tree (in-tree)} is an oriented tree where every vertex except one, called the \emph{root}, has in-degree (out-degree) one. An \emph{out-branching $B_{u}^{+}$ (in-branching…

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

Odd Induced Subgraphs in Graphs of Maximum Degree Four

Large induced subgraphs with prescribed degree parity

Arc-disjoint in- and out-branchings in semicomplete split digraphs

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