Incidence bounds on Edge Partitions of $K_n$
Combinatorics
2020-10-06 v3
Abstract
We solve a problem conjectured by Cheriyan, giving sharp bounds for incidence of certain edge partitions of the connected graph on -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.
Cite
@article{arxiv.2009.02453,
title = {Incidence bounds on Edge Partitions of $K_n$},
author = {Andean E. Medjedovic},
journal= {arXiv preprint arXiv:2009.02453},
year = {2020}
}
Comments
9 pages