Surveys in Combinatorics 2003
Series: London Mathematical Society Lecture Note Series; 307;
- Publisher's listprice GBP 71.00
-
35 933 Ft (34 222 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 7 187 Ft off)
- Discounted price 28 746 Ft (27 378 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
35 933 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number New ed
- Publisher Cambridge University Press
- Date of Publication 24 July 2003
- ISBN 9780521540124
- Binding Paperback
- No. of pages378 pages
- Size 228x152x22 mm
- Weight 502 g
- Language English
- Illustrations 20 b/w illus. 0
Categories
Short description:
Survey papers from British Combinatorial Conference. Researchers and graduates will find much to inspire future work.
MoreLong description:
The British Combinatorial Conference is held every two years and is a key event for mathematicians worldwide working in combinatorics. In June 2003 the conference was held at the University of Wales, Bangor. The papers contained here are surveys contributed by the invited speakers and are of the high quality that befits the event. There is also a tribute to Bill Tutte who had a long-standing association with the BCC. The papers cover topics currently attracting significant research interest as well as some less traditional areas such as the combinatorics of protecting digital content. They will form an excellent resource for established researchers as well as graduate students who will find much here to inspire future work.
MoreTable of Contents:
1. Decompositions of complete graphs: embedding partial edge-colourings and the method of amalgams L. D. Anderson and C. A. Rodger; 2. Combinatorial schemes for protecting digital content Simon R. Blackburn; 3. Matroids and Coxeter groups A. V. Borovik; 4. Algorithmic aspects of graph homomorphisms P. Hell; 5. Finite projective planes with a large Abelian group D. Ghinelli and D. Jungnickel; 6. Partition regular equations I. Leader; 7. Kostka-Foulkes polynomials and Macdonald spherical functions K. Nelsen and A. Ram; 8. Defining sets in combinatorics: a survey D. Donovan, E. S. Mahmoodian, C. Ramsay and A. P. Street; 9. Counting lattice triangulations V. Kaibel and G. Ziegler.
More
