Large generative language models recently gained attention for solving relation extraction tasks, notably because of their flexibility. This is in contrast to encoder-only models that require the definition of predefined output patterns. There has been little research into the impact of the syntax chosen to represent a graph as a sequence of tokens. Moreover, a few approaches have been proposed to extract ready-to-load knowledge graphs following the RDF standard. In this paper, we consider that a set of RDF triples can be linearized in many ways and we evaluate the combined impact of language model size as well as different RDF syntaxes on the task of relation extraction from Wikipedia abstracts