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

TL;DR

This paper improves bounds on the diameter of connected $C_4$-free graphs based on their order and edge-connectivity, and constructs graphs with specific diameter and connectivity properties, advancing understanding in extremal graph theory.

Contribution

The paper provides new upper bounds on the diameter of $C_4$-free graphs with given edge-connectivity and constructs graphs achieving these bounds, extending previous results.

Findings

For $C_4$-free graphs with edge-connectivity at least 3, $d \\leq (2n-3)/5$.

For edge-connectivity at least 4, $d \\leq (n-3)/3$.

Existence of graphs with specified diameter and connectivity based on prime powers.

Abstract

Improving a recent result of Fundikwa, Mazorodze, and Mukwembi, we show that $d \leq (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 \leq (n-3)/3$. Furthermore, adapting a construction due to Erd\H{o}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 $\lambda$ at least $q-6$, in particular, $d\geq 4(n-1)/(\lambda^2+O(\lambda))$.