Self-complementary vertex-transitive graph conjecture

Let G=(V,E)G=(V,E) be a self-complementary, vertex-transitive graph with V=n|V|=n. The self-complementary vertex-transitive conjecture. Its orthogonal representation dimension is

ρ(G)=n/2.\rho ^\perp(G)=\lceil n/2\rceil.

The preceding proposition establishes the lower bound for self-complementary graphs, while the source reports no proof of equality and notes that the hypotheses cannot generally be weakened.

Sources & referencesView supporting material

Primary source

Alberto Solís-Encina and José Ramón Portillo, “Orthogonal Representation of Graphs”, arXiv:1504.03662 (2015).

Progress summary

Never refreshed

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.