污污草莓视频

Title:聽Increasing paths in random temporal graphs

Abstract: We consider a version of the classical Erd艖s鈥揜茅nyi random graph G(n,p) where each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time stamps. We study the lengths of increasing paths: the lengths of the shortest and longest paths between typical vertices, the maxima of these lengths from a given vertex, as well as the maxima between any two vertices; this covers the (temporal) diameter.

This talk is based on joint work with Nicolas Broutin and Nina Kam膷ev.

Zoom link: