3 papers
math.CO2026
Bounds on Odd and Odd-Even Induced Subgraphs
Qiwen Guo, Gregory Gutin, Yiming Hao +3
Let be an -vertex graph and let prescribe degree parities. A set is -admissible if every has degree congruent to…
math.CO2026
A cubic refinement of Jackson's Chvátal--ErdÅs condition for Hamilton cycles in digraphs
Jiangdong Ai, Yongtang Shi
For a digraph , let $\aTwo(D)$ be the largest size of a vertex set no two of whose vertices lie in a common directed -cycle. Let be the least integer such that e…
math.CO2025
Maximal independent sets in graphs with given matching number
Yongtang Shi, Jianhua Tu, Ziyuan Wang
A maximal independent set in a graph is an independent set that cannot be extended to a larger independent set by adding any vertex from . This paper investigates the proble…