Proving the Existence of a GOR Without Probability
Abstract
In this note, we provide a new proof that a D-connected graph G on n vertices has a general position orthogonal representation in n-D. Our argument, while based on many of the concepts from the original proof due to Lov\'asz, Saks and Schrijver, does not use the probabilistic method.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.