Differences

This shows you the differences between two versions of the page.

--- meetings_fall_2026 [2026/09/01 20:57] – created asjensen
+++ meetings_fall_2026 [2026/09/01 21:05] (current) – asjensen
@@ Line 3: / Line 3: @@
 ^ Date ^ Meeting Title ^ Speaker ^ University ^ Abstract ^
-| August 26  | Organizational Meeting |  |  | [[#february_4|Abstract]] |
+| August 26  | Organizational Meeting |  |  |  |
-| August 26  | Organizational Meeting |  |  | [[#february_4|Abstract]] |
+| September 2  | Vertex-Minimal Subgraphs with K_n Minors | David Hathaway | Kansas State University | [[#september_2|Abstract]] |
+| September 9 | TBA | Jiyoung Choi | Kansas State University |  |
+| September 16 | TBA | Pietro Poggi-Corradini | Kansas State University |  |
+| September 23  | TBA | Pietro Poggi-Corradini | Kansas State University |  |
+| September 30  | Duality for the Dirichlet and Thomson problems on networks | Andrew Jensen | Kansas State University |  |
+| October 7  |  |  |  |  |
+| October 14  |  |  |  |  |
+| October 21  |  |  |  |  |
+| October 28  |  |  |  |  |
+| November 4  |  |  |  |  |
+| November 11  |  |  |  |  |
+| November 18  |  |  |  |  |
+| November 25  | **No Meeting (fall break)** |  |  |  |
+| December 2  |  |  |  |  |
+| December 9  |  |  |  |  |
+===== Abstracts =====
+==== September 2  ====
+**"Vertex-Minimal Subgraphs with K_n Minors", David Hathaway**\\
+Let h(G) be the Hadwiger number of G, the largest n such that G has a K_n minor, and define h_n(G) = min{|V(H)| : H\subset G, h(H)=n}, defined for any n = 1, 2, ..., h(G). We seek to study the structure of any given graph through this sequence of orders and its long-term behavior. As a result, the primary focus will be on infinite graphs, in particular those with infinite Hadwiger number. We shall investigate lower bounds originating from basic structural details or from partial knowledge of early elements in the sequence. Along the way, we'll work many examples of interesting finite and infinite graphs.