1 citations · 1 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
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.CO2019★ 1 cited
Lower bounds for rainbow Turán numbers of paths and other trees
Daniel Johnston, Puck Rombach
For a fixed graph , we would like to determine the maximum number of edges in a properly edge-colored graph on vertices which does not contain a rainbow copy of , that is…
math.CO2017
On Edge-Colored Saturation Problems
Michael Ferrara, Daniel Johnston, Sarah Loeb +6
Let be a family of edge-colored graphs. A -edge colored graph is -saturated if does not contain any graph in but the additi…