Split digraphs and their applications
Split graphs are an important class of undirected graphs. I will briefly discuss their structure and some of their usefulness before moving on to a generalization of split graphs to the directed case. I will then discuss, time permitting, an application of these split digraphs in algorithms for sampling directed graph realizations from a fixed degree sequence.
This talk is recommended for undergrads.