We investigate local computation algorithms (LCA) for two-coloring of
k-...
We present a progress on local computation algorithms for two coloring o...
In 1964 Erdős proved that (1+1)) ln(2)/4 k^2 2^k
edges are sufficient to...
In 1964 Erdős proved, by randomized construction, that the minimum numbe...
We show that height h posets that have planar cover graphs have dimensio...
For a hypergraph H, let q(H) denote the expected number of monochromatic...