(k,l)-suitable digraphs

Sun, 01/05/2016 - 14:00
Speaker: 
Seminar: 
Place: 
Abstract: 

We discuss a generalization of k-suitable permutations, defined in 1950 by Dushnik in the context of the order dimension of the boolean lattice.

We relate suitable digraphs to communication settings and prove lower and upper bounds on the cardinality of families of (k,l)-suitable digraphs.

Joint work with Elad Haramaty, Aaron Potechin and Madhu Sudan.