1 citations · 1 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2024
On the two problems in Ramsey achievement games
Zhong Huang, Yusuke Kobayashi, Yaping Mao +2
Let be two integers with . Given a finite graph with no isolated vertices, the generalized Ramsey achievement game of on the complete graph , denoted by…
math.CO2023
Finding a Maximum Restricted -Matching via Boolean Edge-CSP
Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
The problem of finding a maximum -matching without short cycles has received significant attention due to its relevance to the Hamilton cycle problem. This problem is generalize…