שלחו לחבר

(k,l)-suitable digraphs

Seminar
Speaker
Rani Hod (Bar-Ilan University)
Date
01/05/2016 - 15:30 - 14:00
Place
Math building, 3rd floor seminar room (216/201)
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.

תאריך עדכון אחרון : 20/04/2016