Department of

Mathematics


Seminar Calendar
for events the day of Tuesday, June 16, 2020.

     .
events for the
events containing  

(Requires a password.)
More information on this calendar program is available.
Questions regarding events or the calendar should be directed to Tori Corkery.
       May 2020              June 2020              July 2020      
 Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
                 1  2       1  2  3  4  5  6             1  2  3  4
  3  4  5  6  7  8  9    7  8  9 10 11 12 13    5  6  7  8  9 10 11
 10 11 12 13 14 15 16   14 15 16 17 18 19 20   12 13 14 15 16 17 18
 17 18 19 20 21 22 23   21 22 23 24 25 26 27   19 20 21 22 23 24 25
 24 25 26 27 28 29 30   28 29 30               26 27 28 29 30 31   
 31                                                                

Tuesday, June 16, 2020

2:00 pm in Zoom,Tuesday, June 16, 2020

Longest cycles in $3$-connected hypergraphs and bipartite graphs

Misha Lavrov (University of Illinois, Urbana-Champaign)

Abstract: Take a bipartite graph $G$ with bipartition $(X,Y)$ such that $|X|=n$ and $|Y|=m \ge n$. In general, this can't possibly be Hamiltonian, but we can still hope to find a cycle of length $2n$, covering $X$. We show that if $G$ is $3$-connected and the minimum degree in $X$ is at least $\max\{n, \frac{m+10}{4}\}$, then such a cycle always exists; this bound is best possible. In the language of hypergraph, this gives a Dirac-type condition for Hamiltonian Berge cycles in $3$-connected hypergraphs.

This is joint work with Alexandr Kostochka, Ruth Luo, and Dara Zirlin.

Please email Sean at SEnglish (at) illinois (dot) edu for the Zoom ID and password.