If $G$ is a large $K_k$-free graph, by Ramsey's theorem, a large set of vertices is independent. For graphs whose vertices are positive integers, much recent work has been done to identify what arithmetic structure is possible in an independent set. This paper addresses similar problems: for graphs whose vertices are affine or linear spaces over a finite field, and when the vertices of the graph are elements of an arbitrary Abelian group.
@article{10_37236_2732,
author = {David S. Gunderson and Hanno Lefmann},
title = {Graphs on affine and linear spaces and {Deuber} sets},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {2},
doi = {10.37236/2732},
zbl = {1295.05254},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2732/}
}
TY - JOUR
AU - David S. Gunderson
AU - Hanno Lefmann
TI - Graphs on affine and linear spaces and Deuber sets
JO - The electronic journal of combinatorics
PY - 2013
VL - 20
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/2732/
DO - 10.37236/2732
ID - 10_37236_2732
ER -
%0 Journal Article
%A David S. Gunderson
%A Hanno Lefmann
%T Graphs on affine and linear spaces and Deuber sets
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2732/
%R 10.37236/2732
%F 10_37236_2732
David S. Gunderson; Hanno Lefmann. Graphs on affine and linear spaces and Deuber sets. The electronic journal of combinatorics, Tome 20 (2013) no. 2. doi: 10.37236/2732
