J. Byrne

collaborators

3 papers

math.CO2025

New constructions and bounds for nonabelian Sidon sets with applications to TurÃ¡n-type problems

John Byrne, Michael Tait

An $S_{k}$ -set in a group $I^$ is a set $A \subseteq I^$ such that $I^\pm_{1} \dots I^\pm_{k} = I^_{1}^{2} \dots I^_{k}^{2}$ with $I^\pm_{i}, I^_{i}^{2} \in A$ implies $(I^\pm_{1}, \dots, I^\pm_{k}) = (I^_{1}^{2}, \dots, I^_{k}^{2})$ . An $S_{k}^{'}$ -set…

math.CO2025

Expansion in Distance Matrices

John Byrne, Jacob Johnston, Carl Schildkraut +1

The normalized distance Laplacian matrix $D^{L} (G)$ of a graph $G$ is a natural generalization of the normalized Laplacian matrix, arising from the matrix of pa…

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…