2 citations · 2 across the 4 of their papers we have counts for
4 papers
On the Sum Neccesary to Ensure that a Degree Sequence is Potentially H-Graphic
Michael Ferrara, Timothy D. LeSaulnier, Casey K. Moffatt +1
A sequence of nonnegative integers π=(d_1,d_2,...,d_n) is graphic if there is a (simple) graph G with degree sequence π. In this case, G is said to realize or be a realization of π…
Overlap Number of Graphs
Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier +4
An {\it overlap representation} of a graph assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other…
On Permutations Avoiding Short Progressions
Timothy D. LeSaulnier, Sujith Vijay
We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and…
On Monochromatic Ascending Waves
Tim LeSaulnier, Aaron Robertson
A sequence of positive integers is called an ascending wave if for . For integers , let be…