An Upper Bound on the Diameter of a 3-Edge-Connected C4-Free Graph

Fundikwa, Blessings T.; Mazorodze, Jaya Percival; Mukwembi, Simon

doi:10.1007/s13226-020-0505-6

Cited by 3 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…that is, asymptotically, there is only little room for improvements of (1). If λ ≥ 3, then δ ≥ 3, and (1) implies d ≤ 5n 8 , which was recently improved by Fundikwa et al [11] to…”

mentioning

confidence: 99%

“…+ O(1) has been discovered several times [2,9,14,15]. Lower bounds on the order of graphs realizing a certain diameter subject to conditions such as triangle-freeness [9,12], C 4 -freeness [9,11], or conditions involving the chromatic number [5,6] or the edge-connectivity have been studied [1,11,12]. Similar problems for notions related to the diameter also received attention [7,8,13].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Diameter, edge-connectivity, and $C_4$-freeness

Vanessa¹,

Pardey²,

Rautenbach³

2021

Preprint

View full text Add to dashboard Cite

Improving a recent result of Fundikwa, Mazorodze, and Mukwembi, we show that d ≤ (2n−3)/5 for every connected C 4 -free graph of order n, diameter d, and edge-connectivity at least 3, which is best possible up to a small additive constant. For edge-connectivity at least 4, we improve this to d ≤ (n − 3)/3. Furthermore, adapting a construction due to Erdős, Pach, Pollack, and Tuza, for an odd prime power q at least 7, and every positive integer k, we show the existence of a connected C 4 -free graph of order n = (q 2 + q − 1)k + 1, diameter d = 4k, and edge-connectivity λ at least q − 6, in particular, d ≥ 4(n − 1)/(λ 2 + O(λ)).

show abstract

“…that is, asymptotically, there is only little room for improvements of (1). If λ ≥ 3, then δ ≥ 3, and (1) implies d ≤ 5n 8 , which was recently improved by Fundikwa et al [11] to…”

mentioning

confidence: 99%