Matchings and Loose Cycles in the Semirandom Hypergraph Model

Add to your list(s) Download to your calendar using vCal

• Greg Sorkin (LSE)
• Thursday 22 February 2024, 14:30-15:30
• MR12.

If you have a question about this talk, please contact ibl10.

The `semirandom graph process’, introduced in 2020, has attracted a good deal of study. I will discuss the 2-offer 3-uniform semirandom hypergraph model on $n$ vertices. Here, at each step, we are presented with 2 uniformly random vertices. We choose any other vertex, thus creating a hyperedge of size 3. We show a strategy that constructs a perfect matching, and another that constructs a loose Hamilton cycle, both succeeding asymptotically almost surely within $\Theta(n)$ steps. Our methods are qualitatively different from those that have been used for semirandom graphs. Much of the analysis is done on an auxiliary graph that is a uniform $k$-out subgraph of a random bipartite graph, and this tool may be useful in other contexts.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.