Erdős-Pyber theorem for hypergraphs and secret sharing

László Csirmaz, Péter Ligeti, Gábor Tardos

A new, constructive proof with a small explicit constant is given to the Erdős-Pyber theorem which says that the edges of a graph on $n$ vertices can be partitioned into complete b…