临界强连通图的边数
组合数学
2007-05-23 v2
摘要
我们证明了在 n 个顶点上的顶点临界强连通简单有向图中，有向边的最大数目为 n(n-1)/2 - n +4。
引用
@article{arxiv.math/9911113,
title = {The number of edges in critical strongly connected graphs},
author = {Ron Aharoni and Eli Berger},
journal= {arXiv preprint arXiv:math/9911113},
year = {2007}
}
备注
5 pages, no figures, given at the Eleventh Haifa Matrix Theory Conference 26.5.1999 Accepted at Discrete Math. v1 is the submitted version, v2 is the version after the referee's corrections. Note the main correction: the result for edge critical strongly connected graphs is already known