Counting points of slope varieties over finite fields
Enkosky, Tom
Original · EN
The slope variety of a graph is an algebraic set whose points correspond to drawings of a graph. A complement-reducible graph (or cograph) is a graph without an induced four-vertex path. We construct a bijection between the zeroes of the slope variety of the complete graph on n vertices over F₂, and the complement-reducible graphs on n vertices.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.