activity
20112026
most citedCounting copies of a fixed subgraph in -free graphs

74 citations · 102 across the 28 of their papers we have counts for

collaborators

31 papers

math.CO2026

On the Turán number of the directed path

Daniel P. Johnston, Cory Palmer, Amites Sarkar

In this note we determine the maximum number of arcs in a digraph on vertices that does not contain a length- directed path for . Th…

math.CO2023

A generalization of diversity for intersecting families

Van Magnan, Cory Palmer, Ryan Wood

Let be an intersecting family of sets and let be the maximum degree in , i.e., the maximum number of edges of $\…

math.CO2022

Deranged matchings: proofs and conjectures

Daniel Johnston, P. Mark Kayll, Cory Palmer

We introduce, and partially resolve, a conjecture that brings a three-centuries-old derangements phenomenon and its much younger two-decades-old analogue under the same umbrella. T…

math.CO2022★ 3 cited

Positive co-degree density of hypergraphs

Anastasia Halfpap, Nathan Lemons, Cory Palmer

The \emph{minimum positive co-degree} of a non-empty -graph , denoted , is the maximum such that if is an -set contained in a hyperedge of $…

math.CO2022

On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza

Cory Palmer, Balázs Patkós

We connect two classical results in extremal graph theory concerning the number of maximal independent sets. The maximum number mis of maximal independent sets in an -verte…

math.CO2021

Rainbow connectivity of randomly perturbed graphs

József Balogh, John Finlay, Cory Palmer

In this note we examine the following random graph model: for an arbitrary graph , with quadratic many edges, construct a graph by randomly adding edges to and rando…