Size of this PNG preview of this SVG file: 702 × 324 pixels. Other resolutions: 320 × 148 pixels | 640 × 295 pixels | 1,024 × 473 pixels | 1,280 × 591 pixels | 2,560 × 1,182 pixels.
Original file (SVG file, nominally 702 × 324 pixels, file size: 7 KB)
Summary
| Description |
English: The Rado graph, a countably infinite graph that contains every other finite or countably infinite graph as an induced subgraph, as numbered by Rado (1964).
Русский: Построение графа Радо. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
|
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 00:08, 13 March 2010 | | 702 × 324 (7 KB) | David Eppstein | Update to use commons-compatible fonts |
| 21:56, 8 March 2009 |  | 702 × 324 (7 KB) | David Eppstein | {{Information |Description={{en|1=The Rado graph, a countably infinite graph that contains every other finite or countably infinite graph as an induced subgraph, as numbered by Rado (1964).}} |Source=Own work by uploader |Author=[[User: |
File usage
The following 5 pages use this file:
Global file usage
The following other wikis use this file:
- Usage on de.wikipedia.org
- Usage on es.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on fr.wikipedia.org
- Usage on ja.wikipedia.org
- Usage on ko.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on uk.wikipedia.org
- Usage on www.wikidata.org
