Sydney Miyasaki

collaborators

3 papers

math.CO2026

Small $q$ -kernels in digraphs with minimum in-degree $I^´$

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.OC2025

Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers

Daniel Brosch, Bernard LidickÃ½, Sydney Miyasaki +1

In this paper, we investigate three extensions of Ramsey numbers to other combinatorial settings. We first consider ordered Ramsey numbers. Here, we ask for a monochromatic copy of…

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 nu…

Small q-kernels in digraphs with minimum in-degree I^´

Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers

Rainbow TurÃ¡n numbers for short brooms

Small $q$ -kernels in digraphs with minimum in-degree $I^´$