Events
DMS Combinatorics Seminar |
| Time: Nov 01, 2022 (02:00 PM) |
| Location: 328 Parker Hall |
|
Details:
IN PERSON Speaker: Sarah Allred (Vanderbilt) Title: Unavoidable Induced Subgraphs of Large Graphs
Abstract: The classic result of Ramsey states every sufficiently large graph has a large complete graph or large independent set as an induced subgraph. The infinite version of this result states that every infinite graph has an infinite complete graph or an infinite independent set as an induced subgraph. The analogous results for connected graphs state, respectively, that every sufficiently large connected graph has one of a large complete graph, a large star, and a long path as an induced subgraph; and every infinite connected graph has one of an infinite complete graph, an infinite star, and an infinite one-way path as an induced subgraph. We prove analogous results, both the finite and the infinite version, for 2-connected graphs. |
