1 citations · 1 across the 7 of their papers we have counts for
8 papers
Equitable Choosability of Prism Graphs
Kirsten Hogenson, Dan Johnston, Suzanne O'Hara
A graph is equitably -choosable if, for every -uniform list assignment , is -colorable and each color appears on at most vert…
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…
On the sum of a prime and a square-free number with divisibility conditions
Shehzad Hathi, Daniel R. Johnston
Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibili…
Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
Daniel R. Johnston
Using a recent verification of the Riemann hypothesis up to height , we provide strong estimates on and other prime counting functions for finite ranges of $…
Rainbow Saturation
Neal Bushaw, Daniel Johnston, Puck Rombach
We introduce a notion of rainbow saturation and the corresponding rainbow saturation number. This is the saturation version of the rainbow Turán numbers whose systematic study was…
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…