Anastasia Halfpap

activity

20192022

most citedOn supersaturation and stability for generalized Turán problems

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

collaborators

6 papers

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

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…

math.CO2022

The rainbow Turán number of $P_{5}$

Anastasia Halfpap

An edge-colored graph $F$ is rainbow if each edge of $F$ has a unique color. The rainbow Turán number $e x^{*} (n, F)$ of a graph $F$ is the maximum possible number of edges in a proper…

math.CO2020

Rainbow cycles vs. rainbow paths

Anastasia Halfpap, Cory Palmer

An edge-colored graph $F$ is {\it rainbow} if each edge of $F$ has a unique color. The {\it rainbow Turán number} $ex^{*} (n, F)$ of a graph $F$ is the maximum possible number…

math.CO2019★ 1 cited

On supersaturation and stability for generalized Turán problems