Rainbow And Properly Colored Subgraphs
Regular price
€122.99
14 days return policy
Shipping & Delivery
A01=Jie Hu
A01=Xueliang Li
Anti-Ramsey Number
Author_Jie Hu
Author_Xueliang Li
Category=PBV
Category=PBW
Color-Bias Problem
Edge-Colored Graph
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Gallai-Ramsey Number
GallaiAcAEURA"Ramsey Number
Graph System
LocallyGlobally Bounded Edge-Colored Graph
Properly Colored Subgraph
Rainbow Subgraph
Rainbow TurAfA!n Number
Rainbow Turan Number
Uniformly Edge-Colored Graph
Product details
- ISBN 9789819818815
- Publication Date: 24 Nov 2025
- Publisher: World Scientific Publishing Co Pte Ltd
- Publication City/Country: SG
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
Graphs are foundational to combinatorics, modeling relationships across disciplines, from communication networks and social systems to molecular biology. This book presents the first comprehensive treatment of extremal problems in edge-colored graphs, a rapidly developing area at the intersection of graph theory, combinatorics, and applied mathematics.Focusing on the existence of rainbow and properly colored subgraphs, the text explores classical and contemporary topics including anti-Ramsey theory, Gallai-Ramsey results, and rainbow Turán-type problems. It offers a unified framework for understanding how coloring constraints affect graph structure, while drawing connections to Latin squares, transversals, and real-world network models.Rich in theory and application, this accessible and in-depth resource serves as both a reference for researchers and a guide for graduate students, bringing together decades of literature into a coherent and insightful narrative.
