Search

Ramsey proved that for every positive integer $n$, every sufficiently large graph contains an induced $K_n$ or $\overline{K}_n$. Among the many extensions of Ramsey's Theorem there is an analogue for connected graphs: for every positive integer $n$, every sufficiently large connected graph contains an induced $K_n$, $K_{1,n}$, or $P_n$. In this paper, we establish an analogue for 2-connected graphs. In particular, we prove that for every integer exceeding two, every sufficiently large 2-connected graph contains one of the following as an induced subgraph: $K_n$, a subdivision of $K_{2,n}$, a subdivision of $K_{2,n}$ with an edge between the two vertices of degree $n$, and a well-defined structure similar to a ladder., Comment: 15 pages

The pressure to research and evaluate successful programs is certainly not news to faculty and professionals responsible for community-based learning, prison education, or—in the case of Inside-Out—the nexus between the two. Diverse stakeholders are interested in better understanding program impacts, from funders and administrators who want to know about the effects of their financial and institutional investments, to staff who may use program evaluation to improve training or curriculum, to faculty and campus professionals who want to understand and improve community-engagement practices and pedagogies. Others see campus-community partnerships as fertile ground to advance knowledge in a range of disciplines (and perhaps to add to their own publication records as well), and view community-engaged work not as the focus of but as a site or context for research.