Geodesic
Counting points of slope varieties over finite fields
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 complement-reducible graphs on $n$ vertices.
DOI : 10.37236/490
Classification : 05C30, 14G15, 05A19, 05C62
Mots-clés : slope variety, complement reducible graph, cograph 
@article{10_37236_490,
     author = {Thomas Enkosky},
     title = {Counting points of slope varieties over finite fields},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/490},
     zbl = {1205.05107},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/490/}
}
TY  - JOUR
AU  - Thomas Enkosky
TI  - Counting points of slope varieties over finite fields
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/490/
DO  - 10.37236/490
ID  - 10_37236_490
ER  - 
%0 Journal Article
%A Thomas Enkosky
%T Counting points of slope varieties over finite fields
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/490/
%R 10.37236/490
%F 10_37236_490
Thomas Enkosky. Counting points of slope varieties over finite fields. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/490

Cité par Sources :