Minimum semidefinite rank conjecture for graphs of large girth
Let be a connected graph on vertices, and let be an integer. The minimum semidefinite rank is the smallest rank among all positive semidefinite Hermitian matrices with graph . The girth of is the length of its shortest cycle.
Large-girth minimum semidefinite rank conjecture. If has girth at least , then
This conjecture seeks to generalize the known lower bound for connected triangle-free graphs, viewing triangle-freeness as a girth lower bound. Its status is not determined by the supplied source information.
References
2 papers in this index state this conjecture (2016–2017). The statement above is taken from the most recent of them; the others are arXiv:1606.00697.
Source: Louis Deaett and H. Tracy Hall, “Orthogonal representations of Steiner triple system incidence graphs”, arXiv:1708.07741 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.