... graphG×+contains in nitely many 2-fans of type d.Proposition2.2. G×+contains in nitely many 2-fans of type 0.Proof. By Theorem 2.1, n, n − 1,n− 2,m is a 2-fan of type 0 if and only if n =2(a ... G×+contains quite a lot of 3-fans, and it is very likely that itcontains in nitely many 3-fans. It might even be possible that G×+contains in nitelymany 3-fans of a certain type. A short ... N,notbothequalto2, such that x + y and x y are monochromatic. the electronic journal of combinatorics 11 (2004), #R6 1Proposition 2.4. G×+contains in nitely many 2-fans of type 2.Proof. By Theorem...