Cory Palmer

activity

20242026

collaborators

3 papers

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

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…