Prague dimension of random graphs

11/18/2020
by   He Guo, et al.
0

The Prague dimension of graphs was introduced by Nesetril, Pultr and Rodl in the 1970s. Proving a conjecture of Furedi and Kantor, we show that the Prague dimension of the binomial random graph is typically of order n/log n for constant edge-probabilities. The main new proof ingredient is a Pippenger-Spencer type edge-coloring result for random hypergraphs with large uniformities, i.e., edges of size O(log n).

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset