Finding long cycles in balanced tripartite graphs: a first step (Q2073190)

For \(n=1,2\) or \(n\geq 14\), let \(G\) be a balanced tripartite graph on \(3n\) vertices. In this paper, the authors prove that if \(G\) contains at least \(3n^2-4n+5\) edges, then \(G\) contains a cycle of length at least \(3n-1\). They also construct a graph to show the sharpness on the bound of \(|E(G)|\) in this theorem. For the entire collection see [Zbl 1470.05006].