Near-optimal edge partitioning via intersecting families

Alexander Yakunin, Andrey Kupavskii, Alexander Sushin +1

We study the problem of edge partitioning, where the goal is to partition the edge set of a graph into $k$ parts. The replication factor of a vertex $v$ is the number of parts that…