Book Statistics
1 Views
0 Comments
0 Rating

Graph Colouring and the Probabilistic Method

Description

The probabilistic method in graph theory was initiated by Paul Erdös in 1947 .This book is an introduction to this powerful method.The book is well-written and brings the researcher to the frontiers of an exciting field.

It provides an accessible and unified treatment of major advances made in graph colouring via the probabilistic method.Many exercises and excellent remarks are presented and discussed. Also very useful is the list of up-to-date references for current research. This monograph will be useful both to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability.

 

 

Keywords

uniformly�random�colour �equalizing�coin�flip �monocolourable�pairs �acceptable�colouring �colouring�procedure �uncoloured�neighbours �uncoloured�edges �many�repeated�colours uncoloured�vertices �fractional�colouring �dense�vertices �reject�degree �same�dense�set �list�chromatic�number �colouring�multigraphs �external�neighbourhood �partial�colouring total�chromatic�number �respecting�colouring �fractional�chromatic�index �strong�chromatic�index �ornery�sets �strong�chromatic�number �first�moment�method �monochromatic�edges

Download & Read Options

Graph Colouring and the Probabilistic Method.pdf

PDF

Reader's Comments (0)

Login to Comment
No Comments Yet

Be the first to share your thoughts about this book!