Advanced search
Publication Cover
The American Mathematical Monthly Volume 126, 2019 - Issue 2
Submit an article Journal homepage
599
Views
1
CrossRef citations to date
0
Altmetric
MathBit

A Simple Construction to Prove Mycielski’s Theorem

Arpan SadhukhanIndian Statistical Institute
Page 112 | Received 26 Apr 2017, Accepted 06 Jul 2017, Published online: 11 Feb 2019

References

  • Erdős, P. (1959). Graph theory and probability. Canad. J. Math. 11: 34–38.
  • Lovasz, L. (1968). On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hungar. 19: 59–67.
  • Ungar, P., Descartes, B. (1954). Advanced problems and solutions: 4526. Amer. Math. Monthly. 61(5): 352–353. DOI: 10.2307/2307489.
  • West, D. B. (2001). Introduction to Graph Theory, 2nd ed. Upper Saddle River, NJ: Prentice-Hall.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.