# Unavoidable Induced Subgraphs of Large 2-Connected Graphs

@article{Allred2020UnavoidableIS, title={Unavoidable Induced Subgraphs of Large 2-Connected Graphs}, author={Sarah Allred and G. Ding and Bogdan Oporowski}, journal={arXiv: Combinatorics}, year={2020} }

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… Expand

#### Figures from this paper

#### References

SHOWING 1-10 OF 10 REFERENCES

Typical Subgraphs of 3- and 4-Connected Graphs

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 1993

Unavoidable parallel minors of 4-connected graphs

- Mathematics, Computer Science
- J. Graph Theory
- 2009

Unavoidable Minors of Large 3-Connected Matroids

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 1997

Unavoidable Minors of Large 3-Connected Binary Matroids

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 1996

Graph theory, volume 173 of Graduate Texts in Mathematics. Springer, Berlin, fifth edition, 2018

- Paperback edition of [ MR3644391]
- 2018