Sydney Miyasaki

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Small $q$ -kernels in digraphs with minimum in-degree $δ$

Geoffrey Boyer, Matt Burnham, Daniela Černá +5

For a digraph $D$ , a subset $Q \subseteq V (D)$ is called a $q$ -kernel if $Q$ is an independent set and all vertices in $V (D)$ are reachable from $Q$ via a directed path of length at…

math.CO2025

Rainbow Turán numbers for short brooms

John Byrne, E. G. K. M Gamlath, Anastasia Halfpap +2

A graph $G$ is rainbow- $F$ -free if it admits a proper edge-coloring without a rainbow copy of $F$ . The rainbow Turán number of $F$ , denoted $e x^{*} (n, F)$ , is the maximum num…

Small q-kernels in digraphs with minimum in-degree δ

Rainbow Turán numbers for short brooms

Small $q$ -kernels in digraphs with minimum in-degree $δ$