000717332 000__ 02454cam\a22004091i\4500
000717332 001__ 717332
000717332 005__ 20210515102433.0
000717332 006__ m\\\\\o\\d\\\\\\\\
000717332 007__ cr\cn\nnnunnun
000717332 008__ 150206t20132013gw\a\\\\ob\\\\001\0\eng\d
000717332 019__ $$a868638818
000717332 020__ $$a9783319013152$$qelectronic book
000717332 020__ $$z9783319013145
000717332 035__ $$a(OCoLC)ocn870244444
000717332 035__ $$a(CaPaEBR)ebr10815782
000717332 035__ $$a717332
000717332 040__ $$aCaPaEBR$$beng$$erda$$epn$$cCaPaEBR
000717332 05014 $$aQA166$$b.P78 2013eb
000717332 1001_ $$aPrömel, H. J.
000717332 24510 $$aRamsey theory for discrete structures$$h[electronic resource] /$$cHans Jürgen Prömel.
000717332 264_1 $$aCham ;$$aNew York :$$bSpringer,$$c[2013]
000717332 264_4 $$c©2013
000717332 300__ $$a1 online resource (xvi, 232 pages) :$$billustrations
000717332 336__ $$atext$$2rdacontent
000717332 337__ $$acomputer$$2rdamedia
000717332 338__ $$aonline resource$$2rdacarrier
000717332 504__ $$aIncludes bibliographical references and index.
000717332 5050_ $$aForeword by Angelika Steger -- Preface -- Conventions -- Part I Roots of Ramsey Theory: 1.1 Ramseys theorem -- 1.2 From Hilberts cube lemma to Rados thesis -- Part II A Starting Point of Ramsey Theory: Parameter Sets: 2.1 Definitions and basic examples -- 2.2 Hales-Jewetts theorem -- 2.3 Graham-Rothschilds theorem -- 2.4 Canonical partitions -- Part III Back to the Roots: Sets: 3.1 Ramsey numbers -- 3.2 Rapidly growing Ramsey functions -- 3.3 Product theorems -- 3.4 A quasi Ramsey theorem -- 3.5 Partition relations for cardinal numbers -- Part IV Graphs and Hypergraphs: 4.1 Finite graphs -- 4.2 Infinite graphs -- 4.3 Hypergraphs on parameter sets -- 4.4. Ramsey statements for random graphs -- 4.5 Sparse Ramsey Theorems.-Part V Density Ramsey Theorems: 5.1 Szemers Theorem -- 5.2 Density Hales-Jewett Theorem -- 5.3 Proof of the density Hales-Jewett theorem -- References -- Index.
000717332 506__ $$aAccess limited to authorized users.
000717332 588__ $$aDescription based on print version record.
000717332 650_0 $$aRamsey theory.
000717332 650_0 $$aComputational complexity.
000717332 650_0 $$aCombinatorial analysis.
000717332 77608 $$iPrint version:$$aPrömel, H. J.$$tRamsey theory for discrete structures.$$dCham ; New York : Springer, [2013]$$z9783319013145$$w(DLC) 2013956012$$w(OCoLC)879250120
000717332 8520_ $$bacq
000717332 85280 $$bebk$$hEbrary
000717332 85640 $$3ProQuest Ebook Central$$uhttps://univsouthin.idm.oclc.org/login?url=https://ebookcentral.proquest.com/lib/usiricelib-ebooks/detail.action?docID=1593028$$zOnline Access
000717332 909CO $$ooai:library.usi.edu:717332$$pGLOBAL_SET
000717332 980__ $$aEBOOK
000717332 980__ $$aBIB
000717332 982__ $$aEbook
000717332 983__ $$aOnline