74 citations · 102 across the 28 of their papers we have counts for
5 papers · 1 filter
At most stable matchings
Cory Palmer, Dömötör Pálvölgyi
We improve the upper bound for the maximum possible number of stable matchings among jobs and applicants from to . To establish this bound, we…
Rainbow cycles vs. rainbow paths
Anastasia Halfpap, Cory Palmer
An edge-colored graph is {\it rainbow} if each edge of has a unique color. The {\it rainbow Turán number} of a graph is the maximum possible number…
Some exact results for generalized Turán problems
Dániel Gerbner, Cory Palmer
Fix a -chromatic graph . In this paper we consider the question to determine for which graphs does the Turán graph have the maximum number of copies of a…
Maximum size intersecting families of bounded minimum positive co-degree
József Balogh, Nathan Lemons, Cory Palmer
Let be an -uniform hypergraph. The \emph{minimum positive co-degree} of , denoted by , is the minimum such that if is…
Turán numbers for hypergraph star forests
Omid Khormali, Cory Palmer
Fix a graph . We say that a graph is {\it -free} if it does not contain as a subgraph. The {\it Turán number} of , denoted , is the maximum number of…