First order sentence modeled by an infinite graph Suppose we have a sentence $\chi$ in the language $L = \left\{E\right\}$ of graphs, where $E$ is a binary relation symbol (intended to be there is an edge between $x$ and $y$).
And let the graph axioms be so that a model is a symmetric graph with no loops. 
The question is suppose we have an infinite graph $\Gamma$ such that $\Gamma \models \chi$ ( $\chi$ is true in $\Gamma$)
is it necessarily true that there are infinitely many finite graphs in which $\chi$ is true? 
I feel like the answer is probably, yes. Because for any sentence it seems like if I have a subgraph of $\Gamma$ which somehow contains all the elements I "need" for $\chi$ , it must also model the sentence. However, I have been unable to formalize this intuition so I'm no longer even sure if its correct.
Also note that this is homework, so I'd appreciate if possible people can help me to get to the correct solution rather than posting an entirely complete solution. 

Hint There is exactly one person who has only one neighbour. Everybody else has exactly two.  
