Hida families and ideal class groupsNumber Theory Lunch Semina
AbstractIn an $n$-vertex graph, it is simple to see that $n$ edges imply the graph has a cycle. However, this cycle can be any length from $3$ to $n$. If we have more edges, do we get cycles of many different lengths? Can we find a cycle with some control over its length? In this talk, based on joint work with Hong Liu, I will discuss how to construct cycles of many different lengths in graphs,...