Contemporary combinatorics
Author(s)
Bibliographic Information
Contemporary combinatorics
(Bolyai Society mathematical studies, 10)
Springer , János Bolyai Mathematical Society, 2002
Available at 25 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C||Contemporary-402026538
Note
Includes bibliographical references
Description and Table of Contents
Description
This volume is a collection of survey papers in combinatorics that have grown out of lectures given in the workshop on Probabilistic Combinatorics at the Paul Erdos Summer Research Center in Mathematics in Budapest. The papers, reflecting the many facets of modern-day combinatorics, will be appreciated by specialists and general mathematicians alike: assuming relatively little background, each paper gives a quick introduction to an active area, enabling the reader to learn about the fundamental results and appreciate some of the latest developments. An important feature of the articles, very much in the spirit of Erdos, is the abundance of open problems.
Table of Contents
1. N. Alon: Graph Powers.- 2. J. Beck: TIC-TAC-TOE.- 3. R. Arratia: On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer.- 4. B. Bollobas/L. Pebody/D. Weinreich: A State Space Definition of the HOMFLY Invariant.- 5. G. Brightwell/P. Winkler: Random Colorings of a Cayley Tree.- 6. S. Janson: On Concentration of Probability.- 7. B. Bollobas/A.D. Scott: Better Bounds for Max Cut.- 8. D. Coppersmith/ G.B. Sorkin: On the Expected Incremental Cost of a Minimum Assignment.
by "Nielsen BookData"