13 problems
Let be a simple graph, and let denote its minimum degree. Write for the greatest codimension of a faithful orthogonal representation whose Gram matrix has…
Fix a simple graph with minimum degree . A faithful orthogonal representation assigns vectors to the vertices so that two vertices are represented by orthogonal vect…
Let be a finite-dimensional real Hilbert space, and let be finite. For a generic , consider the Gram graph of the orbit . Real one-orbit…
Let be a positive integer, let be a finite group, and let be homomorphisms. Two such homomorphisms are -equivalent if they…
Let , let be a partition, and let be the number of stable-square-length-extremal surfaces, orientable or no…
Let be a finitely generated group. Let be an orthogonal representation, and let be an irreducible…
Let be a graph, let be its complement, and let denote orthogonal representation dimension. The complementary-dimension bounds conjecture. The two di…
Let be a self-complementary, vertex-transitive graph with . The self-complementary vertex-transitive conjecture. Its orthogonal representation dimension is … The p…
Let be a critical graph (not banned), let be a maximal matching, and suppose that its orthogonal representation dimension satisfies . The matching-…
Let a graph be critical banned in dimension when it is banned in dimension but deleting any vertex lowers the required dimension. Two vertices are isomorphic when deleting…
Let a graph be banned in dimension when it has no orthogonal representation in dimension . If a vertex of valence in a graph banned in dimension is doubled, then the…
Let , let be an arbitrary field, and let be a graph on vertex set . Primality and complete-intersection conjecture. If is -connected, then is…