CANCELLED: PC Seminar: H-semi-random graph process
- Date
- to
- Location
- Ångström Laboratory, 64119
- Type
- Seminar
- Lecturer
- Margarita Akhmejanova
- Organiser
- Matematiska institutionen
- Contact person
- Sascha Troscheit
- Language
- English
This seminar was cancelled on short notice.
Abstract: Abstract: We study hitting times of monotone graph properties in the H-semi-random graph process, where in each round Builder chooses an edge from a uniformly random copy of a fixed graph H. The case H=K_{1,n-1} corresponds to the usual semi-random graph process. Recently, we prepared a paper with the case H=K_{1,s}: in each round, a uniformly random vertex u is revealed together with a uniformly random s-element subset $S\subseteq[n]\setminus\{u\}$, and Builder chooses v from S. and adds the edge uv. I will discuss our matching upper and lower bounds for several spanning properties, as well as our results on cliques and intermediate results for clique factors.
This is a seminar in our seminar series on Probability and Combinatorics (PC).