Conjecture 7.1 (The Triangle Conjecture [1]}) 
Triangle detection requires \(m^{4/3-o(1)}\)  time, for some density regime \(m=\Omega (n)\) . In other words, there exists a constant \(1 \le \alpha \le 2\)  such that for all \(\varepsilon > 0\)  there is no algorithm that given a graph with \(n\)  nodes and \(m = \Theta (n^\alpha )\)  edges detects whether it contains a triangle in \(O(m^{4/3-\varepsilon })\)  time.

