Surveys in Combinatorics, 2001
Series: London Mathematical Society Lecture Note Series; 288;
- Publisher's listprice GBP 63.00
-
31 884 Ft (30 366 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. 6 377 Ft off)
- Discounted price 25 507 Ft (24 293 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
31 884 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 Rev ed
- Publisher Cambridge University Press
- Date of Publication 5 July 2001
- ISBN 9780521002707
- Binding Paperback
- No. of pages312 pages
- Size 227x154x19 mm
- Weight 434 g
- Language English
- Illustrations 1 b/w illus. 0
Categories
Short description:
This volume contains the invited talks from the 18th British Combinatorial Conference, held in 2001.
MoreLong description:
The British Combinatorial Conference is held every two years and is now a key event for mathematicians worldwide, working in combinatorics. This volume is published on the occasion of the 18th meeting, which was held 1st-6th July 2001 at the University of Sussex. The papers contained here are surveys contributed by the invited speakers, and are thus of a quality befitting the event. There is also a tribute to Crispin Nash-Williams, past chairman of the British Combinatorial Committee. The diversity of the subjects covered means that this will be a valuable reference for researchers in combinatorics. However, graduate students will also find much here that could be of use for stimulating future research.
MoreTable of Contents:
1. Crispin Nash-Williams J. Sheehan; 2. The Penrose polynomial of graphs and matroids M. Aigner; 3. Cyclic designs I. Anderson; 4. Orthogonal designs and space-time codes for wireless communication A. R. Calderbank and A. F. Naguib; 5. Sampling and counting unlabelled structures L. A. Goldberg; 6. Graphs on surfaces and graph minors B. Mohar; 7. Graph colouring with the probabilistic method M. S. O. Molloy; 8. The interplay between graphs and matroids J. G. Oxley; 9. Ovoids, spreads and m-systems of finite classical polar spaces J. A. Thas; 10. List colourings of graphs D. R. Woodall.
More
