FDL > PVS > Graphs > ramsey new > subgraph clique > pf:subgraph clique > 1 > 1 > 1 > 1 > 1 > 1 > 1

Conclusion

-1. C!1(x!1)
-2. C!1(x!1) = > (vert(g!1)(x!1) AND V!1(x!1))
-3. card(C!1) > = p!1
-4. FORALL i_2004:T, j : ((NOT (i_2004 = j)) AND C!1(i_2004) AND C!1(j)) IMPLIES ((NOT (i_2004 = j)) AND edges(g!1)(dbl[T](i_2004, j)) AND (FORALL x:T : ((x = i_2004) OR (x = j)) IMPLIES V!1(x)))

1. vert(g!1)(x!1)