Qiwen Guo

collaborators

5 papers

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

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.CO2026

Forward Arc Maximization for Hamilton Oriented Cycles and Paths in Generalizations of Tournaments

Q. Guo, G. Gutin, Y. Lan +3

Gishboliner, Krivelevich, and Michaeli (2023) conjectured the following generalization of Dirac's theorem: If the minimum degree $I^´$ of an $n$ -vertex oriented graph $G$ is greater…

math.CO2026

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition

Jiangdong Ai, Qiwen Guo, Gregory Gutin +4

Erd{\H o}s (1963) initiated extensive graph discrepancy research on 2-edge-colored graphs. Gishboliner, Krivelevich, and Michaeli (2023) launched similar research on oriented graph…

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…