Topics in Gallai-Ramsey Theory

AvColton Magnant,Pouria Salehi Nowbandegani

Häftad, Engelska, 2020

Del i serien SpringerBriefs in Mathematics

712 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book explores topics in Gallai-Ramsey theory, which looks into whether rainbow colored subgraphs or monochromatic subgraphs exist in a sufficiently large edge-colored complete graphs. A comprehensive survey of all known results with complete references is provided for common proof methods. Fundamental definitions and preliminary results with illustrations guide readers to comprehend recent innovations. Complete proofs and influential results are discussed with numerous open problems and conjectures. Researchers and students with an interest in edge-coloring, Ramsey Theory, and colored subgraphs will find this book a valuable guide for entering Gallai-Ramsey Theory.

Produktinformation

Utgivningsdatum:2020-07-05
Mått:155 x 235 x 10 mm
Vikt:184 g
Format:Häftad
Språk:Engelska
Serie:SpringerBriefs in Mathematics
Antal sidor:104
Förlag:Springer Nature Switzerland AG
ISBN:9783030488963

Utforska kategorier

Kombinatorik och grafteori inom Naturvetenskap och teknik

Recensioner i media

“In the opinion of the reviewer, Topics in Gallai-Ramsey theory is a well-organized, well-written, valuable compendium of results in the foundation and halfway up to the second story of the newly christened area of Gallai-Ramsey theory. … this book and efforts in the area will have helped to shape whatever comes next.” (Peter D. Johnson, Jr., Mathematical Reviews, April, 2022)“This book is an excellent and much sought after material addressing Gallai-Ramsey theory. … this book is meant for very serious researchers in this topic.” (V. Yegnanarayanan, zbMATH 1452.05001, 2021)

Innehållsförteckning

1. Introduction and Basic Definitions.- 2. General Structure Under Forbidden Rainbow Subgraphs.- 3. Gallai-Ramsey Results for Rainbow Triangles.- 4. Gallai-Ramsey Results for Other Rainbow Subgraphs.- 5. Conclusion and Open Problems.