Ngày tải lên :
07/08/2014, 06:23
... (2, 3, 4) that G → (2, 2, 2, 4) Therefore F (2, 2, 2, 4; 6) ≤ F (2, 3, 4; 6) and hence it is sufficient to prove that F (2, 3, 4; 6) ≤ 14 and F (2, 2, 2, 4; 6) ≥ 14 Proof of the inequality F (2, ... Folkman graphs Discrete n n Math., 23 6, 20 01, 24 5 - 26 2 [5] J Mycielski, Sur le coloriage des graphes Colloq Math., 3, 1 955 , 161 -1 62 [6] N Nenov, An example of a 15- vertex (3,3)-Ramsey graph with ... then F (2, 3, 4; 6) ≤ 14 Proof of the inequality F (2, 2, 2, 4; 6) ≥ 14 Let G → (2, 2, 2, 4) and cl(G) < We need to prove that |V (G)| ≥ 14 It is clear from G → (2, 2, 2, 4) that G − A → (2, 2, 4)...