Incidence bounds on Edge Partitions of K_n

arXiv2009.02453MaRDI QIDQ6348449FDOQ6348449

Authors: Andean E. Medjedovic 

Publication date: 5 September 2020

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.

This page was built for publication: Incidence bounds on Edge Partitions of $K_n$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348449)