Image:Fourth Mycielski graph.svg

From Wikipedia, the free encyclopedia

Fourth_Mycielski_graph.svg‎ (9KB, MIME type: image/svg+xml)

Wikimedia Commons logo This is a file from the Wikimedia Commons. The description on its description page there is shown below.

[edit] Summary

Very hastily drawn image of the fourth Mycielski graph. Mycielski proved in 1955 that for every k\ge1 there is a graph with chromatic number k that contains no triangle subgraphs, that is, whose maximal clique size is just 2. The chromatic number of this graph is 4.

If you can make this image look better, by all means do so.

[edit] Licensing

Public domain I, the author of this work, hereby release it into the public domain. This applies worldwide.

In case this is not legally possible:
I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

Afrikaans | Alemannisch | Aragonés | العربية | Български | Català | Česky | Cymraeg | Dansk | Deutsch | Ελληνικά | English | Español | Esperanto | فارسی | Français | Galego | 한국어 | हिन्दी | Hrvatski | Ido | Bahasa Indonesia | Íslenska | Italiano | עברית | Latina | Lietuvių | Magyar | Bahasa Melayu | Nederlands | Norsk (bokmål) | Norsk (nynorsk) | 日本語 | Polski | Português | Ripoarish | Română | Русский | Slovenčina | Slovenščina | Српски | Svenska | ไทย | Türkçe | Українська | Tiếng Việt | Walon | 简体中文 | 繁體中文 | 粵語 | +/-

The following pages on the English Wikipedia link to this file (pages on other projects are not listed):

Retrieved from "http://en.wikipedia.org../../../f/o/u/Image%7EFourth_Mycielski_graph.svg_8778.html"