Among the mathematical concepts named after Mycielski are: • The
Ehrenfeucht–Mycielski sequence, a sequence of
binary digits with
pseudorandom properties • The
Mycielskian, a construction for embedding any
undirected graph into a larger graph with strictly higher
chromatic number without creating any additional
triangles. • The
Mycielski–Grötzsch graph, the Mycielskian of the 5-
cycle, an 11-vertex
triangle-free graph that is the smallest possible triangle-free graph requiring four colors. •
Mycielski's theorem that there exist triangle-free graphs with arbitrarily large chromatic number. ==Awards and honors==