Incidence bounds on Edge Partitions of $K_n$

Abstract

We solve a problem conjectured by Cheriyan, giving sharp bounds for incidence of certain edge partitions of the connected graph on $n$-vertices. We briefly discuss the history of the problem and relation to node connectivity of strongly regular graphs. We show that the bound cannot be made sharper.