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

Public ___domain 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.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

8 March 2009

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current00:08, 13 March 2010Thumbnail for version as of 00:08, 13 March 2010702 × 324 (7 KB)David EppsteinUpdate to use commons-compatible fonts
21:56, 8 March 2009Thumbnail for version as of 21:56, 8 March 2009702 × 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:

Global file usage

The following other wikis use this file: