Placeholder text

Go to cart

RAINBOW AND PROPERLY COLORED SUBGRAPHS

By Li Xueliang

RAINBOW AND PROPERLY COLORED SUBGRAPHS

By Li Xueliang

0 - Default Title
Description
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.
Product details
Number of Pages:
308
Release Date:
2025-10-27
Publication Date:
2025-10-27
Publisher:
World Scientific
Languages:
Original: English
ISBN10:
9819818818
ISBN13:
9789819818815
Weight:
599 g
Height:
157 cm
Width:
235 cm
Thickness:
21 cm
Buy on Amazon
Currently sold out