C. Kaneshiro

activity

20242026

collaborators

4 papers

math.CO2026

On k-coalition partitions of graphs

Claire Kaneshiro

In a graph, a set $D$ is $k$ -dominating if every vertex in $V (G) ∖ D$ has at least $k$ neighbors in $D$ . Jafari, Alikhani, and Bakhshesh introduced the concept of a $k$ -coa…

math.CO2026

Coarse Balanced Separators in Biclique-Induced-Minor-Free Graphs

Maria Chudnovsky, Julien Codsi, Claire Kaneshiro

It is a classical theorem of Robertson and Seymour (1986) that the treewidth of a graph is linearly related to its separation number: the smallest integer $k$ such that, for every…

math.PR2025

A New Proof of the Abstract Random Tensor Estimate by Deng, Nahmod, and Yue

Claire Kaneshiro

We provide a new proof of the abstract random tensor estimate. This estimate was initially proven by Deng, Nahmod, and Yue (2022) using the moment method. The key new tool in our p…

math.CO2024

Well-edge-dominated graphs containing triangles

Jake Berg, Perryn Chang, Claire Kaneshiro +4

A set of edges $F$ in a graph $G$ is an edge dominating set if every edge in $G$ is either in $F$ or shares a vertex with an edge in $F$ . $G$ is said to be well-edge-dominated if a…