CD(2,)CD(2,\infty) conjecture for strongly regular graphs of girth three

From papers

Let G=(V,E)G=(V,E) be a strongly regular graph. Its girth is the length of its shortest cycle; in particular, girth 33 means that GG contains a triangle. Strongly regular girth-three conjecture. Every strongly regular graph with girth 33 satisfies CD(2,)CD(2,\infty). The preceding curvature formulas establish the corresponding cases of girth four and five, but the asserted girth-three case is left as a belief in the source.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

David Cushing, Shiping Liu and Norbert Peyerimhoff, “Bakry-Émery curvature functions of graphs”, arXiv:1606.01496 (2017).

Solutions 0

No solutions have been posted yet.