The Girth Ramsey Theorem
Christian Reiher · Vojtěch Rödl
Mar 2027 · Annals of Mathematics Studies Book 226 · Princeton University Press
Ebook
208
Pages
family_home
Eligible
info
infoThis book will become available on March 30, 2027. You will not be charged until it is released.
About this ebook
An introduction to structural Ramsey theory that builds to a resolution of one of its long-standing conjectures
Structural Ramsey theory is an area of combinatorics about Ramsey-type statements dealing with hypergraphs as well as other combinatorial structures. Rather than mainly focusing on numerical aspects such as Ramsey numbers, structural Ramsey theory focuses on the existence of Ramsey-type statements and their connection with some other fields of mathematics. In this book, Christian Reiher and Vojtěch Rödl introduce structural Ramsey theory and solve a long-standing problem regarding locally sparse Ramsey graphs.
The book has two parts. The first part, which is suitable for a topics course, introduces tools used in the construction of locally sparse Ramsey graphs and hypergraphs, and covers several well-known results, such as Ramsey’s theorem and the Hales-Jewett theorem. The focus is on structural Ramsey theory of hypergraphs and on the introduction of partite construction, which is illustrated by several of its applications yielding the proof of some older results in the area. The second part establishes the girth Ramsey theorem, resolving a decades’ old conjecture in structural Ramsey theory implying that for every graph G and every number of colors, there exists a Ramsey graph H with girth(H) = girth(G).
Structural Ramsey theory is an area of combinatorics about Ramsey-type statements dealing with hypergraphs as well as other combinatorial structures. Rather than mainly focusing on numerical aspects such as Ramsey numbers, structural Ramsey theory focuses on the existence of Ramsey-type statements and their connection with some other fields of mathematics. In this book, Christian Reiher and Vojtěch Rödl introduce structural Ramsey theory and solve a long-standing problem regarding locally sparse Ramsey graphs.
The book has two parts. The first part, which is suitable for a topics course, introduces tools used in the construction of locally sparse Ramsey graphs and hypergraphs, and covers several well-known results, such as Ramsey’s theorem and the Hales-Jewett theorem. The focus is on structural Ramsey theory of hypergraphs and on the introduction of partite construction, which is illustrated by several of its applications yielding the proof of some older results in the area. The second part establishes the girth Ramsey theorem, resolving a decades’ old conjecture in structural Ramsey theory implying that for every graph G and every number of colors, there exists a Ramsey graph H with girth(H) = girth(G).
An introduction to structural Ramsey theory that builds to a resolution of one of its long-standing conjectures
Structural Ramsey theory is an area of combinatorics about Ramsey-type statements dealing with hypergraphs as well as other combinatorial structures. Rather than mainly focusing on num...
Discover more
About the author
Christian Reiher is a lecturer in mathematics at the University of Hamburg. Vojtěch Rödl is Samuel Candler Dobbs Professor at Emory University.
Christian Reiher is a lecturer in mathematics at the University of Hamburg. Vojtěch Rödl is Samuel Candler Dobbs Professor at Emory University.
Reading information
Smartphones and tablets
Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.
Laptops and computers
You can listen to audiobooks purchased on Google Play using your computer's web browser.
eReaders and other devices
To read on e-ink devices like Kobo eReaders, you'll need to download a file and transfer it to your device. Follow the detailed Help Center instructions to transfer the files to supported eReaders.
