Masaki Kashima

collaborators

12 papers

math.CO2026

Diagonal Ramsey numbers for wheels

Maoxuan Li, Masaki Kashima, Yaping Mao

The Ramsey number $R (G_{1}, G_{2})$ is the smallest integer $N$ such that any red-blue coloring of the edges of the complete graph $K_{N}$ contains either a red copy of $G_{1}$ or…

math.CO2026

List packing of graphs with bounded tree-width

Masaki Kashima, Shun-ichi Maezawa, Xuding Zhu

Assume $L$ is a $k$ -assignment of a graph $G$ . An $L$ -packing $I ¨ $ of $G$ is a sequence $I ¨ = (I ¨ _{1}, \dots, I ¨ _{k})$ of $k$ -mappings such that each $I ¨ _{i}$ is an $L$ -coloring of $G$ , a…

math.CO2026

Induced Ramsey numbers for fans

Chuang Zhong, Masaki Kashima, Yaping Mao +1

The induced Ramsey number $r_{ind} (G, H)$ is defined as the minimum order of a graph $F$ on such that any 2-coloring of its edges with red and blue leads to either a red in…

math.CO2026

A Note on GrÃ¼nbaum's Conjecture about Longest Cycles and Paths

Masaki Kashima, Kenta Ozeki, Leilei Zhang

Let $c (G)$ denote the circumference of a graph $G$ , i.e., the number of vertices in its longest cycle. For positive integers $n$ and $k$ with $n > k$ , let $Γ (n; k)$ be the cla…

math.CO2026

Degree-choosability of proper conflict-free list coloring of sparse graphs

Masaki Kashima, Riste Å krekovski, Rongxing Xu

Given a graph $G$ and a mapping $f : V (G) \to N$ , an $f$ -list assignment of $G$ is a function that maps each $v \in V (G)$ to a set of at least $f (v)$ colors. For an $f$ -list…

math.CO2025

A note on the number of non-cycle components in a pseudo 2-factor of graphs

Masaki Kashima

A pseudo 2-factor of a graph is a spanning subgraph such that each component is $K_{1}$ , $K_{2}$ , or a cycle. This notion was introduced by Bekkai and Kouider in 2009, where they showe…