A finite partition theorem with double exponential bound

Saharon Shelah

doi:10.1007/978-1-4614-7254-4_18

A finite partition theorem with double exponential bound

Saharon Shelah^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

We prove that double exponentiation is an upper bound to Ramsey’s theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.

Original language	English
Title of host publication	The Mathematics of Paul Erdos II, Second Edition
Publisher	Springer New York
Pages	237-244
Number of pages	8
ISBN (Electronic)	9781461472544
ISBN (Print)	9781461472537
DOIs	https://doi.org/10.1007/978-1-4614-7254-4_18
State	Published - 1 Jan 2013

Bibliographical note

Publisher Copyright:
© Springer Science+Business Media New York 2013.

Access to Document

10.1007/978-1-4614-7254-4_18

Cite this

@inbook{a7080629d0ed40138e4f702d2ef1c86f,

title = "A finite partition theorem with double exponential bound",

abstract = "We prove that double exponentiation is an upper bound to Ramsey{\textquoteright}s theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.",

author = "Saharon Shelah",

note = "Publisher Copyright: {\textcopyright} Springer Science+Business Media New York 2013.",

year = "2013",

month = jan,

day = "1",

doi = "10.1007/978-1-4614-7254-4_18",

language = "אנגלית",

isbn = "9781461472537",

pages = "237--244",

booktitle = "The Mathematics of Paul Erdos II, Second Edition",

publisher = "Springer New York",

address = "ארצות הברית",

}

TY - CHAP

T1 - A finite partition theorem with double exponential bound

AU - Shelah, Saharon

PY - 2013/1/1

Y1 - 2013/1/1

N2 - We prove that double exponentiation is an upper bound to Ramsey’s theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.

AB - We prove that double exponentiation is an upper bound to Ramsey’s theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.

UR - http://www.scopus.com/inward/record.url?scp=84956631862&partnerID=8YFLogxK

U2 - 10.1007/978-1-4614-7254-4_18

DO - 10.1007/978-1-4614-7254-4_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:84956631862

SN - 9781461472537

SP - 237

EP - 244

BT - The Mathematics of Paul Erdos II, Second Edition

PB - Springer New York

ER -

A finite partition theorem with double exponential bound

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this