# Philip Garrison

Email: [click here]@cs.uw.edu

Encrypted contact: keybase

Office: CSE 406

Office hours (Spring 2019): M 3-4pm CSE 3rd floor breakout

I am a PhD student in the Computer Science & Engineering school at UW, where I work in the ICTD group.
Previously, I was a researcher at the United Nations University Institute on Computing and Society, in Macau, where I worked on the social media tracking tool Aggie.

I am interested in global justice in technology development as well as practices that give people power over the technology that shapes their world, including participatory design, free software, and popular governance.

I got my bachelor's degrees in math and computer science from Carnegie Mellon University in fall of 2015.
My CMU education was supplemented by the lovely Budapest Semesters in Mathematics program.
In university, my academic interests focused on graph theory, logic, network routing theory, and quantum computing.

# Math problems

Below are some open problems suitable for a motivated undergrad. Don't hesitate to get in touch if these strike your curiousity.

## Graphs without paths

Let G be a connected graph on N or more vertices with no subgraph isomorphic to the path on N vertices, P_{N}. A vertex v of G is *abundant* if it has degree at least N-1 and *deficient* if it has degree less than floor(N/2). Does G necessarily have more abundant vertices than deficient vertices?
## Three triangle factors

Let G_{1}=(V, E_{1}), G_{2}=(V,E_{2}), G_{3}=(V,E_{3}) be three graphs on the same set of vertices, and assume that they share no edges, i.e. 0 = |E_{1}∩E_{2}| = |E_{1}∩E_{3}| = |E_{2}∩E_{3}|. Further, assume that for each of G_{1}, G_{2}, and G_{3}, each connected component of the graph is (isomorphic to) a triangle (K_{3}). Then, let G = (V, E_{1}∪E_{2}∪E_{3}) be the graph on the same vertex set using all the edges. Does G necessarily have a vertex coloring using at most 5 colors?