Alex Parker

collaborators

2 papers

math.CO2025

New bounds on a generalization of Tuza's conjecture

Alex Parker

For a $k$ -uniform hypergraph $H$ , let $I^½^{(m)} (H)$ denote the maximum size of a set $S$ of edges of $H$ whose pairwise intersection has size less than $m$ . Let $I ¨ ^{(m)} (H)$ denot…

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…