Counting points of slope varieties over finite fields (Q625361)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting points of slope varieties over finite fields |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting points of slope varieties over finite fields |
scientific article |
Statements
Counting points of slope varieties over finite fields (English)
0 references
17 February 2011
0 references
Summary: The slope variety of a graph is an algebraic set whose points correspond to drawings of that 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 \(\mathbb F_2\), and the complementreducible graphs on \(n\) vertices.
0 references
slope variety
0 references
complement reducible graph
0 references
cograph
0 references
