"I applied to the program for the support for my research. I hope to learn all of the character traits that make someone a good academic researcher. My goals for the year are to prove the Ramsey theorem for matchings and investigate infinite antichains in a partial order on matchings."
Combinatorics and combinatorial algorithms
Academic and Other Awards
- University Scholars Program Scholarship (2011-2012)
GatorTrax, a program to support math and science education in K-12 students.
Hobbies and Interests
- Computer programming, open source software, learning German, and public policy.
A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every sufficiently long indecomposable matching contains a long indecomposable submatching of one of three types.