Mycielskian

In mathematics and graph theory, a Mycielski graph, or Mycielski construction, is a method for constructing new graphs from existing ones. The Mycielski construction is used primarily to create triangle-free graphs, which are graphs that do not contain any cycles of length three (triangles). The construction works as follows: 1. **Start with a graph \( G \)**: This can be any simple graph.