Cory Palmer

activity

20242026

most citedPositive co-degree densities and jumps

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

collaborators

6 papers

math.CO2026

$1$ -cross intersecting set pair systems are small

Dylan King, Van Magnan, Cory Palmer

A set pair system ${(A_{i}, B_{i})}_{i = 1}^{m}$ is $1$ -cross intersecting if $∣ A_{i} \cap B_{i} ∣ = 0$ for all $i$ and $∣ A_{i} \cap B_{j} ∣ = 1$ whenever $i \neq = j$ . Let $m (a, b, 1)$ denote the maximu…

math.CO2026

Matchings in hypergraphs via Ore-degree conditions

József Balogh, Cory Palmer, Ghaffar Raeisi

Let $H \subseteq (r [ n ])$ be an $r$ -uniform hypergraph on vertex set $[n] = {1, 2, \dots, n}$ . For an $r$ -set of vertices $S \subseteq [n]$ , the \emph{degree} of $…

math.CO2025

Survey of generalized Turán problems -- counting subgraphs

Dániel Gerbner, Cory Palmer

For fixed graphs $H$ and $F$ , the \emph{generalized Turán number} $ex (n, H, F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$ -vertex $F$ -free graph. T…

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

Generalized Ramsey-Turán Numbers

József Balogh, Van Magnan, Cory Palmer

The Ramsey-Turán problem for $K_{p}$ asks for the maximum number of edges in an $n$ -vertex $K_{p}$ -free graph with independence number $o (n)$ . In a natural generalization of the proble…

math.CO2024

Directed graphs without rainbow stars

Daniel Gerbner, Andrzej Grzesik, Cory Palmer +1

In a rainbow version of the classical Turán problem one considers multiple graphs on a common vertex set, thinking of each graph as edges in a distinct color, and wants to determin…