arXiv subjects

Claire Kaneshiro

Publications and source records attributed to Claire Kaneshiro.

4 recordsLinked to original sources

arXiv2026

On k-coalition partitions of graphs

In a graph, a set $D$ is $k$-dominating if every vertex in $V(G) \setminus D$ has at least $k$ neighbors in $D$. Jafari, Alikhani, and Bakhshesh introduced the concept of a $k$-coalition, which is a pair of disjoint sets $X_1$ and $X_2$ of vertices such that neither is a $k$-dominating set but $X_1 \cup X_2$ is a $k$-dominating set. A $k$-coalition partition is a vertex partition in which each set either forms a $k$-coalition with some other set or is itself a $k$-dominating set with exactly $k$ vertices. The $k$-coalition number $\operatorname{CO_k}(G)$ is the maximum number of sets in a $k$-coalition partition. We compute the $k$-coalition number for several families and bound the $k$-coalition number under disjoint union and graph join. We show that the set of possible sizes of $k$-coalition partitions forms an interval. Finally, we investigate $k$-coalition graphs and prove that every graph is a $k$-coalition graph.

math.CO↗

arXiv2026

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

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 weight function on the vertices, the graph admits a balanced separator of size at most $k$. Motivated by recent progress on coarse treewidth, Abrishami, Czyżewska, Kluk, Pilipczuk, Pilipczuk, and Rzażewski (2025) conjectured the following coarse analogue: for every $r\in \mathbb{N}$ there exists an $r'\in \mathbb{N}$ such that every graph that admits balanced separators that can be covered by a bounded number of balls of bounded radius $r$ admits a tree decomposition where every bag can be covered by a bounded number of balls of radius $r'$. We verify a stronger variant of this conjecture for all $r \in \mathbb{N}$ for the hereditary class of $K_{t,t}$-induced-minor-free graphs of bounded clique number. A key step in the proof is the following result, which we expect to be of independent interest. In $K_{t,t}$-induced-minor-free graphs with clique number bounded by $s$, given a large subset of vertices $Y \subseteq V(G)$, there is a set $Z$ whose size is bounded by a function polynomial in $s$, such that no ball of radius $r$ in $G- Z$ covers a large proportion of $Y$.

math.CO↗

arXiv2025

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

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 proof is the direct use of the non-commutative Khintchine inequality with the probabilistic decoupling of the product of Gaussians. Hermite and generalized Laguerre-type polynomials allow us to account for pairings in the real and complex-valued Gaussians, respectively, and remove the square-free (tetrahedral) requirement.

math.PR↗

arXiv2024

Well-edge-dominated graphs containing triangles

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 all of its minimal edge dominating sets have the same cardinality. Recently it was shown that any triangle-free well-edge-dominated graph is either bipartite or in the set $\{C_5, C_7, C_7^*\}$ where $C_7^*$ is obtained from $C_7$ by adding a chord between any pair of vertices distance three apart. In this paper, we completely characterize all well-edge-dominated graphs containing exactly one triangle, of which there are two infinite families. We also prove that there are only eight well-edge-dominated outerplanar graphs, most of which contain at most one triangle.

math.CO↗