I read in several places, including Wikipedia, that a tessellation of the plane by a single, convex, $n-$sided polygon is not possible for $n\geq7$. I was not able to locate a proof, or a paper that discusses this. Maybe it is too trivial, but I am not able to figure it out myself.
So I would like to ask you for help. Where can I find a proof for this?
Also, I am interested in the mathematical background behind plane tiling (especially periodic), If you can suggest papers on the topic it would really help.
In a tessellation of the entire plane by convex tiles at least three tiles will meet in each corner of each tile. Therefore the average of inner angles of the tile cannot be higher than 120 degrees. The sum of the inner angles of an $n$-gon is $(n-2)180$. If $n>6$, then their average $180(n-2)/n=180(1-\frac2n)>180(1-\frac26)=120$.