Masaki Kashima

activity

20242026

collaborators

Showing 2026Show all

7 papers · 1 filter

math.CO2026

A Solution to the Kohayakawa-Prömel-Rödl Conjecture

Chuang Zhong, Masaki Kashima, Yaping Mao

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

math.CO2026

The rich-neighbor chromatic index is linear in the maximum degree

Masaki Kashima, Mirko Petruševski, Jelena Sedlar +1

An edge of a multigraph is rich with respect to a proper edge-coloring if all the edges adjacent to it receive mutually distinct colors, and a proper edge-coloring is a rich-neighb…

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 $ϕ$ of $G$ is a sequence $ϕ = (ϕ_{1}, \dots, ϕ_{k})$ of $k$ -mappings such that each $ϕ_{i}$ is an $L$ -coloring of $G$ , and fo…

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…