**Materials and Methods: **The study cohort included 1091 patients who received 1918 dental implants between 2004 and 2012, and had their implants restored by a crown or a fixed dental prosthesis. Data were collected from patient records, entered in a database, and summarized in tables and figures. Contingency tables were prepared and analyzed by a chi-squared test. The cumulative survival probability of implants was described using a Kaplan-Meier survival curve. Univariate and multivariate frailty Cox regression models for clustered observations were computed to identify factors associated with implant failure.

**Results: **Mean patient age (±1 SD) at implantation was 59.7 ± 15.3 years; 53.9% of patients were females, 73.5% were Caucasians. Noble Biocare was the most frequently used implant brand (65.0%). Most implants had a regular-size diameter (59.3%). More implants were inserted in posterior (79.0%) than in anterior jaw regions. Mandibular posterior was the most frequently restored site (43%); 87.8% of implants were restored using single implant crowns. The overall implant-based cumulative survival rate was 96.4%. The patient-based implant survival rate was 94.6%. Implant failure risk was greater among patients than within patients (*p* < 0.05). Age (>65 years; hazard ratio [HR] = 3.2, *p* = 0.02), implant staging (two-stage; HR = 4.0, *p* < 0.001), and implant diameter (wide; HR = 0.4, *p* = 0.04) were statistically associated with implant failure.

**Conclusions: **Treatment with dental implants in a supervised predoctoral clinic environment resulted in survival rates similar to published results obtained in private practice or research clinics. Older age and implant staging increased failure risk, while the selection of a wide implant diameter was associated with a lower failure risk.

For graphs *G* and *H*, an *H-coloring* of *G* is an adjacency preserving map from the vertices of *G* to the vertices of *H*. *H*-colorings generalize such notions as independent sets and proper colorings in graphs. There has been much recent research on the extremal question of finding the graph(s) among a fixed family that maximize or minimize the number of *H*-colorings. In this paper, we prove several results in this area.

First, we find a class of graphs H with the property that for each H∈H, the *n*-vertex tree that minimizes the number of *H *-colorings is the path P_{n}. We then present a new proof of a theorem of Sidorenko, valid for large *n*, that for *every H * the star K_{1,n−1} is the *n*-vertex tree that maximizes the number of *H*-colorings. Our proof uses a stability technique which we also use to show that for any non-regular *H* (and certain regular *H *) the complete bipartite graph K_{2,n−2} maximizes the number of *H*-colorings of *n *-vertex 2-connected graphs. Finally, we show that the cycle C_{n} has the most proper *q*-colorings among all *n*-vertex 2-connected graphs.