𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of Ramsey null sets

✍ Scribed by Marcin Sabok

Book ID
113421945
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
205 KB
Volume
230
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On ramsey families of sets
On ramsey families of sets
✍ VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1990 πŸ› Springer Japan 🌐 English βš– 508 KB
Ramsey classes of set systems
Ramsey classes of set systems
✍ Jaroslav NeΕ‘etΕ™il; VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 969 KB
Ramsey numbers for sets of small graphs
Ramsey numbers for sets of small graphs
✍ Holger Brandes; Heiko Harborth; Hans-Dietrich O.F. Gronau; Christian Schwahn πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 733 KB

The Ramsey number r=r(G1-GZ-...-G,,,,H1-Hz-...-Hn) denotes the smallest r such that every 2-coloring of the edges of the complete graph K, contains a subgraph Gi with all edges of one color, or a subgraph Hi with all edges of a second color. These Ramsey numbers are determined for all sets of graph