Marcelo Mydlarz

most citedApproximate Multipartite Version of the Hajnal--Szemerédi Theorem

6 citations · 8 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CC2013★ 2 cited

Topological Additive Numbering of Directed Acyclic Graphs

Javier Marenco, Marcelo Mydlarz, Daniel Severin

We propose to study a problem that arises naturally from both Topological Numbering of Directed Acyclic Graphs, and Additive Coloring (also known as Lucky Labeling). Let $D$ be a d…

math.CO2008★ 6 cited

Approximate Multipartite Version of the Hajnal--Szemerédi Theorem

Bela Csaba

Let $q$ be a positve integer, and $G$ be a $q$ -partite simple graph on $q n$ vertices, with $n$ vertices in each vertex class. Let $δ = \frac{k _{q}}{k _{q} + 1}$ , where $k_{q} = q + O (lo g q)$ . I…