Anastasia Halfpap

activity

20192025

most citedPositive co-degree density of hypergraphs

3 citations · 5 across the 12 of their papers we have counts for

collaborators

Showing math.COShow all

12 papers · 1 filter

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

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…

math.CO2024★ 1 cited

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 $δ_{r - 1}^{+} (H)$ , is the largest integer $k$ such that for every $(r - 1)$ -set $S \subset V (H)$ , if $S$ is contai…

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

math.CO2024

Positive co-degree thresholds for spanning structures

Anastasia Halfpap, Van Magnan

The \textit{minimum positive co-degree} of a non-empty $r$ -graph $H$ , denoted $δ_{r - 1}^{+} (H)$ , is the largest integer $k$ such that if a set $S \subset V (H)$ of size $r - 1$ is contai…

math.CO2024

Rational exponents for cliques

Sean English, Anastasia Halfpap, Robert A. Krueger

Let $ex (n, H, F)$ be the maximum number of copies of $H$ in an $n$ -vertex graph which contains no copy of a graph from $F$ . Thinking of $H$ and $\mathcal…