The universal homogeneous triangle-free graph, constructed by Henson [15] and denoted H 3 , is the triangle-free analogue of the Rado graph. While the Ramsey theory of the Rado graph has been completely established, beginning with Erdős-Hajnal-Posá [6] and culminating in work of Sauer [32] and Laflamme-Sauer-Vuksanovic [19], the Ramsey theory of H 3 had only progressed to bounds for vertex colorings [17] and edge colorings [31]. This was due to a lack of broadscale techniques.We solve this problem in general: For each finite triangle-free graph G, there is a finite number T (G) such that for any coloring of all copies of G in H 3 into finitely many colors, there is a subgraph of H 3 which is again universal homogeneous triangle-free in which the coloring takes no more than T (G) colors. This is the first such result for a homogeneous structure omitting copies of some non-trivial finite structure. The proof entails developments of new broadscale techniques, including a flexible method for constructing trees which code H 3 and the development of their Ramsey theory. Overview Ramsey theory of finite structures is a well-established field with robust current activity. Seminal examples include the classes of finite linear orders [30], finite Boolean algebras [12], finite vector spaces over a finite field [10], finite ordered graphs [1], [24] and [25], finite ordered k-clique-free graphs [24] and [25], as well as many more recent advances. Homogeneous structures are infinite structures in which any isomorphism between two finitely generated substructures can be extended to an automorphism of the whole structure. A class of finite structures may have the Ramsey property, while the homogeneous structure obtained by taking its limit may not. The most basic example of this is linear orders. The rational numbers are the Fraïssé limit of the class of all finite linear orders. The latter has the Ramsey property, while the rationals do not: There is a coloring of pairs of rational numbers into two colors such that every subset of the rationals forming another dense linear order without endpoints has pairs taking each of the colors [2].A central question in the theory of homogeneous relational structures asks the following: Given a homogeneous structure S and a finite substructure A, is there a 2010 Mathematics Subject Classification. 05D10, 05C55, 05C15, 05C05, 03C15, 03E75.