- Format
- Häftad (Paperback)
- Språk
- Engelska
- Antal sidor
- 336
- Utgivningsdatum
- 2009-07-09
- Förlag
- Cambridge University Press
- Medarbetare
- Mitchell, James D. / Roney-Dougal, Colva M.
- Illustrationer
- 5 tones 50 worked examples 45 figures
- Volymtitel
- Series Number 365 Surveys in Combinatorics 2009
- Dimensioner
- 229 x 152 x 19 mm
- Vikt
- Antal komponenter
- 1
- Komponenter
- 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam
- ISSN
- 0076-0552
- ISBN
- 9780521741736
- 495 g
Du kanske gillar
-
Build
Tony Fadell
InbundenHorse Anatomy Workbook
Maggie Raynor
Spiral boundThe God Equation
Michio Kaku
InbundenSurveys in Combinatorics 2009
594- Skickas inom 10-15 vardagar.
- Gratis frakt inom Sverige över 199 kr för privatpersoner.
Finns även somPassar bra ihop
De som köpt den här boken har ofta också köpt Braiding Sweetgrass av Robin Wall Kimmerer (häftad).
Köp båda 2 för 705 krKundrecensioner
Har du läst boken? Sätt ditt betyg »Fler böcker av Sophie Huczynska
-
Contemporary Developments In Finite Fields And Applications
Gove Effinger, Daniel Panario, Leo Storme, Anne Canteaut, Sophie Huczynska
The volume is a collection of 20 refereed articles written in connection with lectures presented at the 12th International Conference on Finite Fields and Their Applications ('Fq12') at Skidmore College in Saratoga Springs, NY in July 2015. Finite...
Övrig information
Sophie Huczynska is Royal Society Dorothy Hodgkin Research Fellow in the School of Mathematics and Statistics at the University of St Andrews. James D. Mitchell is RCUK Academic Fellow and Lecturer in Pure Mathematics in the School of Mathematics and Statistics at the University of St Andrews. Colva M. Roney-Dougal is Lecturer in Pure Mathematics in the School of Mathematics and Statistics at the University of St Andrews.
Innehållsförteckning
Preface; 1. Graph decompositions and symmetry Arrigo Bonisoli; 2. Combinatorics of optimal designs R. A. Bailey and Peter J. Cameron; 3. Regularity and the spectra of graphs W. H. Haemers; 4. Trades and t-designs G. B. Khosrovshahi and B. Tayfeh-Rezaie; 5. Extremal graph packing problems: Ore-type versus Dirac-type H. A. Kierstead, A. V. Kostochka, and G. Yu; 6. Embedding large subgraphs into dense graphs Daniela Khn and Deryk Osthus; 7. Counting planar graphs and related families of graphs Omer Gimnez and Marc Noy; 8. Metrics for sparse graphs B. Bollobs and O. Riordan; 9. Recent results on chromatic and flow roots of graphs and matroids G. F. Royle.