Let ω(G) and χ(G) be the clique number and the chromatic number of a graph G. Mycielski  presented a construction that for any n creates a graph Mn which is triangle-free (ω(G) = 2) with χ(G) > n. The starting point is the complete graph of two vertices (K2). M(n+1) is obtained from Mn through the operation μ(G) called the Mycielskian of a graph G.
We first define the operation μ(G) and then show that ω(μ(G)) = ω(G) and χ(μ(G)) = χ(G) + 1. This is done for arbitrary graph G, see also . Then we define the sequence of graphs Mn each of exponential size in n and give their clique and chromatic numbers.
 Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.
 Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.
 Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.
 Grzegorz Bancerek. Bounds in posets and relational substructures. Formalized Mathematics, 6(1):81-91, 1997.
 Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.