Let t â‰¥ 3 be an integer and G be a 2-connected K1,t-free graph. We show that if t â‰¥ 4 and minimum degree of G is at least 2t+1, then G has a 6-factor. We also show that if t = 3 and minimum degree ofâ€¦ (More)

Let G be a directed graph and H a subgraph of G. A D(G,H, Î») design is a multiset D of subgraphs of G each isomorphic to H so that every directed 2-path in G lies in exactly Î» subgraphs in D. In thisâ€¦ (More)

Over the past decade, my father and I have designed several typefaces based on mathematical theorems and open problems, specifically computational geometry [DD15, DD]. These typefaces expose theâ€¦ (More)