Rainbow And Properly Colored Subgraphs

Jie Hu (Nankai University, China), Xueliang Li (Nankai University, China)

$320.95 $257.15

Hardback

Forthcoming
Pre-Order now

QTY:

English

World Scientific Publishing Co Pte Ltd
17 November 2025

Combinatorics & graph theory; Applied mathematics

Series: Series on Concrete & Applicable Mathematics

Summary
Details

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.

By: Jie Hu (Nankai University China), Xueliang Li (Nankai University, China)
Imprint: World Scientific Publishing Co Pte Ltd
Country of Publication: Singapore
Volume: 26
ISBN: 9789819818815
ISBN 10: 9819818818
Series: Series on Concrete & Applicable Mathematics
Pages: 308
Publication Date: 17 November 2025
Audience: College/higher education , Professional and scholarly , Primary , Undergraduate
Format: Hardback
Publisher's Status: Forthcoming