A Simple Construction to Prove Mycielski’s Theorem

DOI10.1080/00029890.2018.1521240zbMath1406.05038OpenAlexW2914174837MaRDI QIDQ3120217

Arpan Sadhukhan

Publication date: 1 March 2019

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00029890.2018.1521240

zbMATH Keywords

chromatic numbertriangle-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Graph Theory and Probability
• On chromatic number of finite set-systems

This page was built for publication: A Simple Construction to Prove Mycielski’s Theorem