Anastasia Halfpap

collaborators

4 papers

math.CO2025

A note on the rainbow TurÃ¡n number of brooms with length 2 handles

Anastasia Halfpap

For a fixed graph $F$ , the rainbow TurÃ¡n number $e x^{*} (n, F)$ is the largest number of edges possible in an $n$ -vertex graph which admits a rainbow- $F$ -free proper edge-col…

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…

math.CO2024

Positive co-degree densities and jumps

JÃ³zsef Balogh, Anastasia Halfpap, Bernard LidickÃ½ +1

The minimum positive co-degree of a nonempty $r$ -graph $H$ , denoted by $I^´_{r - 1}^{+} (H)$ , is the largest integer $k$ such that for every $(r - 1)$ -set $S \subset V (H)$ , if $S$ is conta…

math.CO2024

On the proper rainbow saturation numbers of cliques, paths, and odd cycles

Dustin Baker, Enrique Gomez-Leos, Anastasia Halfpap +7

Given a graph $H$ , we say a graph $G$ is properly rainbow $H$ -saturated if there is a proper edge-coloring of $G$ which contains no rainbow copy of $H$ , but adding any edge to $G$ …