Kombinatorik och grafteori

Biggs' Discrete Mathematics has been a best-selling textbook since the first and revised editions were published in 1986 and 1990, respectively. This second edition has been developed in response to undergraduate course changes and changes in students' needs. New to this edition are chapters on statements and proof, logical framework, and natural numbers and the integers, in addition to updated chapters from the previous edition. The new chapters are presented at a level suitable for mathematics and computer science students seeking a first approach to this broad and highly relevant topic. Each chapter contains newly developed tailored exercises, and miscellaneous exercises are presented throughout, providing the student with over 1000 individual tailored exercises. This edition is accompanied by a website www.oup.com/mathematics/discretemath containing hints and solutions to all exercises presented in the text, providing an invaluable resource for students and lecturers alike. The book is carefully structured, coherent and comprehensive, and is the ideal text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory, coding theory and abstract algebra.

Percolation theory is the study of an idealized random medium in two or more dimensions. The mathematical theory is mature, and continues to give rise to problems of special beauty and difficulty. Percolation is pivotal for studying more complex physical systems exhibiting phase transitions. The emphasis of this book is upon core mathematical material and the presentation of the shortest and most accessible proofs. The book is intended for graduate students and researchers in probability and mathematical physics. Almost no specialist knowledge is assumed. Much new material appears in this second edition, including: dynamic and static renormalization, strict inequalities between critical points, a sketch of the lace expansion, and several essays on related fields and applications.

This undergraduate text is designed for a single-semester introductory course in discrete mathematics. It is aimed at students of mathematics and computer science, as well as problem-solving enthusiasts or anyone with some familiarity with proofs seeking a concise introduction to the subject. The primary goal is to acquaint readers with key structures and ideas in combinatorial and discrete mathematics that will support further study in mathematics and its applications.Requiring minimal prerequisites, the book seeks to build appreciation while offering a clear foundation for developing combinatorial reasoning. Special attention is given to the basics of enumeration and generating functions. Background concepts are presented accessibly, and examples appear early and frequently. When suitable, multiple proofs are provided for the same result, offering insight into mathematical thinking and the interconnectedness of ideas. Each chapter concludes with a selection of exercises spanning a wide range of difficulty, and a collection of hints and solutions is included at the end of the book.

This standard textbook on modern graph theory combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject, with concise yet complete proofs, while offering glimpses of more advanced methods in each field via one or two deeper results.This is a major new edition. Among many other improvements, it offers additional tools for applying the regularity lemma, brings the tangle theory of graph minors up to the cutting edge of current research, and addresses new topics such as chi-boundedness in perfect graph theory.The book can be used as a reliable text for an introductory graduate course and is also suitable for self-study.From the reviews:“Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity.” Persi Diaconis & Ron Graham, SIAM Review“The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theory.” Bulletin of the Institute of Combinatorics and its Applications“Succeeds dramatically ... a hell of a good book.” MAA Reviews“ ... like listening to someone explain mathematics.” Bulletin of the AMS

Är det verkligen möjligt att reducera 5 miljoner spelrader, 170 miljoner, ja HELA Spelplanen med 99,9 % med mycket bra resultat?! Ja, bevisligen när författaren i denna bok introducerar Guds Matematik och skapar magi!! Matematiken besegrar slumpen i denna bok!! Hur skicklig är Du i att kunna tippa rätt vinstrad i spel som berör sporter med avdelningar, lopp och race som exempelvis inom trav- och galoppsport? Hur långt är det i praktiken möjligt att nå i reduceringen av ett spelsystem för att ändå ha kvar 1 -felsreducering, det vill säga 1 fel från alla rätt och därigenom mycket enklare kunna få alla rätt, det vill säga högsta vinsten? I Matematikens seger över slumpen: Jolly Trot & Gallop System - De Optimala Systemen 1 (Trav/galoppsystem), besvarar författaren bland annat dessa två frågor ingående genom att visa hur man räknar fram sin skicklighet samt bevisar med tydliga instruktioner, formler, tabeller, bilder och färdiga system hur det med bibehållen 1-felsreducering verkligen går att reducera spelsystem från gängse uppfattning inom matematiken, att en sådan reduceringsgrad ligger på drygt 91 %, till hela ofattbara 98,6 % i praktiken enligt kombinationsmatematiken för små system!! Författaren har på ett fantastiskt unikt sätt med delvis hjälp av framtagen matematik från den schweiziske sjuttonhundratals matematikern Leonhard Euler, bevisligen lyckats utveckla optimalt reducerade spelsystem och visar i formel att det är möjligt att fortsätta reducera ett sådant system mer än 99,999% ! (Men med Guds Matematik för stora system blir det förbi 99,9 %!!) Dessutom ger författaren mycket bra instruktioner genom tydliga illustrationer, intressanta tips och råd för den som i praktiken vill använda systemen för spel samt delar med sig av hans egna erfarenheter kring travspel och annat. Med andra ord är denna bok ett MÅSTE för alla matematiskt intresserade inom kombinatorik och spelsystem och givetvis för alla systemspelare såsom exempelvis trav- och galoppspelare!!

This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mathematics. One of the first results in this story is a short elegant solution of the Kakeya problem for finite fields, which was considered a deep and difficult problem in combinatorial geometry. The author also discusses in detail various problems in incidence geometry associated to Paul Erdos's famous distinct distances problem in the plane from the 1940s. The proof techniques are also connected to error-correcting codes, Fourier analysis, number theory, and differential geometry. Although the mathematics discussed in the book is deep and far-reaching, it should be accessible to first- and second-year graduate students and advanced undergraduates. The book contains approximately 100 exercises that further the reader's understanding of the main themes of the book.

Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and computer science. The first part of the text deals with traditional crossing number, crossing number values, crossing lemma, related parameters, computational complexity, and algorithms. The second part includes the rich history of alternative crossing numbers, the rectilinear crossing number, the pair crossing number, and the independent odd crossing number.It also includes applications of the crossing number outside topological graph theory.Aimed at graduate students and professionals in both mathematics and computer scienceThe first book of its kind devoted to the topicAuthored by a noted authority in crossing numbers

Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, which stems from many years' experience of teaching, invites students into the subject and prepares them for more advanced texts. It is suitable as a class text or for individual study. The author provides proofs for many of the theorems to show the range of techniques available, and uses examples to link enumerative combinatorics to other areas of study. The main section of the book introduces the key tools of the subject (generating functions and recurrence relations), which are then used to study the most important combinatorial objects, namely subsets, partitions, and permutations of a set. Later chapters deal with more specialised topics, including permanents, SDRs, group actions and the Redfield-Pólya theory of cycle indices, Möbius inversion, the Tutte polynomial, and species.

Over the past few decades, graph theory has developed into one of the central areas of modern mathematics, with close (and growing) connections to areas of pure mathematics such as number theory, probability theory, algebra and geometry, as well as to applied areas such as the theory of networks, machine learning, statistical physics, and biology. It is a young and vibrant area, with several major breakthroughs having occurred in just the past few years. This book offers the reader a gentle introduction to the fundamental concepts and techniques of graph theory, covering classical topics such as matchings, colourings and connectivity, alongside the modern and vibrant areas of extremal graph theory, Ramsey theory, and random graphs. The focus throughout is on beautiful questions, ideas and proofs, and on illustrating simple but powerful techniques, such as the probabilistic method, that should be part of every young mathematician's toolkit.

Confusing Textbooks? Missed Lectures? Not Enough Time?

Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.

This Schaum's Outline gives you

Practice problems with full explanations that reinforce knowledgeCoverage of the most up-to-date developments in your course fieldIn-depth review of practices and applications

Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores!

Schaum's Outlines-Problem Solved.

Denna bok innehåller del II av den större studien och artikelsamlingen "Den första matematiken", som utgör en genomgång av några grundläggande begrepp och samband ur talteori och diskret matematik, med fördjupande eller reflekterande kommentarer. Artiklarna använder den speciella framställningsform eller layout som författaren valt att kalla för den holistiska. Boken riktar sig till studenter och lärare i matematik, data/IT, logik eller filosofi, men även till en allmän matematiskt eller filosofiskt intresserad publik.

This book shows how our lives are shaped not only by the choices we make, but by the choices we have.From dating, school and university applications to the job market, understand the most important decisions you’ll ever make with insights from a Nobel Prize-winner.Who Gets What and Why is a piquantly written, mind-expanding exploration of the markets that matter most to many of us. If you’ve ever sought a job or hired someone, applied to university or guided your child into a good school, asked someone out on a date or been asked out, you have participated in a matching market. They are everywhere around us and account for some of the biggest technological successes of the decade, like Uber and Airbnb. Matching markets can even be the gatekeeper of life itself, guiding how desperately ill patients receive scarce organs for transplants.Alvin E. Roth shared the 2012 Nobel Prize in economics for his pioneering research into market design – the principles that govern all kinds of markets where money isn’t the only factor in determining who gets what. His book reveals what factors make these markets work well – or badly – and shows us all how to recognise a good match and make smarter, more confident decisions.

Confusing Textbooks?

Missed Lectures?

Tough Test Questions?

Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.

This Schaum's Outline gives you

Practice problems with full explanations that reinforce knowledgeCoverage of the most up-to-date developments in your course fieldIn-depth review of practices and applications

Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores!

Schaum's Outlines-Problem Solved.

Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the book delves deeper into the properties of the principal eigenvector; a critical subject as many of the results on the spectral radius of graphs rely on the properties of the principal eigenvector for their proofs. A following chapter surveys spectral radius of special graphs, covering multipartite graphs, non-regular graphs, planar graphs, threshold graphs, and others. Finally, the work explores results on the structure of graphs having extreme spectral radius in classes of graphs defined by fixing the value of a particular, integer-valued graph invariant, such as: the diameter, the radius, the domination number, the matching number, the clique number, the independence number, the chromatic number or the sequence of vertex degrees.

Throughout, the text includes the valuable addition of proofs to accompany the majority of presented results. This enables the reader to learn tricks of the trade and easily see if some of the techniques apply to a current research problem, without having to spend time on searching for the original articles. The book also contains a handful of open problems on the topic that might provide initiative for the reader's research.

Dedicated coverage to one of the most prominent graph eigenvalues Proofs and open problems included for further study Overview of classical topics such as spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem

Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal, nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics, coding theory, and cryptography, the text provides a detailed survey of their main results, presenting a systematic overview of their generalizations and applications, and considering open problems in classification and systematization of bent functions.

The text is appropriate for novices and advanced researchers, discussing proofs of several results, including the automorphism group of bent functions, the lower bound for the number of bent functions, and more.

Provides a detailed survey of bent functions and their main results, presenting a systematic overview of their generalizations and applications Presents a systematic and detailed survey of hundreds of results in the area of highly nonlinear Boolean functions in cryptography Appropriate coverage for students from advanced specialists in cryptography, mathematics, and creators of ciphers

Fixed Point Theory and Graph Theory provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges.

This edited reference work is perhaps the first to provide a link between the two theories, describing not only their foundational aspects, but also the most recent advances and the fascinating intersection of the domains.

The authors provide solution methods for fixed points in different settings, with two chapters devoted to the solutions method for critically important non-linear problems in engineering, namely, variational inequalities, fixed point, split feasibility, and hierarchical variational inequality problems. The last two chapters are devoted to integrating fixed point theory in spaces with the graph and the use of retractions in the fixed point theory for ordered sets.

Introduces both metric fixed point and graph theory in terms of their disparate foundations and common application environments Provides a unique integration of otherwise disparate domains that aids both students seeking to understand either area and researchers interested in establishing an integrated research approach Emphasizes solution methods for fixed points in non-linear problems such as variational inequalities, split feasibility, and hierarchical variational inequality problems that is particularly appropriate for engineering and core science applications

For junior- to senior-level courses in Graph Theory taken by majors in Mathematics, Computer Science, or Engineering or for beginning-level graduate courses.  Once considered an “unimportant” branch of topology, graph theory has come into its own through many important contributions to a wide range of fields — and is now one of the fastest-growing areas in discrete mathematics and computer science. This new text introduces basic concepts, definitions, theorems, and examples from graph theory. The authors present a collection of interesting results from mathematics that involve key concepts and proof techniques; cover design and analysis of computer algorithms for solving problems in graph theory; and discuss applications of graph theory to the sciences. It is mathematically rigorous, but also practical, intuitive, and algorithmic.

With You Every Step of the WayThe Tobey/Slater/Blair/Crawford series retains the hallmark characteristics that have always made the text so easy to learn and teach from, including a “building block” organization. Each program builds essential skills and conceptual understanding by breaking the mathematics down into manageable pieces.  The new editions address the latest trends and dynamics related to developmental mathematics course structures, including helping students gain a stronger conceptual understanding, while contextualizing the math. Instructors will find the inclusion of new conceptually oriented Guided Learning Videos with the accompanying Video Workbook with the Math Coach (in MyMathLab), plus a new emphasis on Career Explorations throughout the text and MyMathLab course to help students explore potential career paths. The Tobey series is flexible, and well-suited for a variety of classroom formats, including lecture-based, computer-lab based (modular and/or self-paced), hybrid, and online. Also available with MyMathLabMyMathLab® is an online homework, tutorial, and assessment program designed to work with this text to engage students and improve results. Within its structured environment, students practice what they learn, test their understanding, and pursue a personalized study plan that helps them absorb course material and understand difficult concepts. For this edition, the MyMathLab course includes new Guided Learning Videos and an updated and expanded Video Workbook with the Math Coach.  Note: You are purchasing a standalone product; MyLab™ & Mastering™ does not come packaged with this content. Students, if interested in purchasing this title with MyLab & Mastering, ask your instructor for the correct package ISBN and Course ID. Instructors, contact your Pearson representative for more information.  If you would like to purchase boththe physical text and MyLab & Mastering, search for:0134266382 / 9780134266381 * Beginning Algebra: Early Graphing plus MyMathLab -- Access Card PackagePackage consists of: 0134178971 / 9780134178974 * Beginning Algebra: Early Graphing0321431308 / 9780321431301 * MyMathLab -- Glue-in Access Card0321654064 / 9780321654069 * MyMathLab Inside Star Sticker

This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. The book is in four parts. The first introduces the basic ideas of coding theory. The second and third parts cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. These parts are linked by their use of Euclid's algorithm as a central technique. The fourth part is devoted to Goppa codes, both classical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature of this part is a simplified (but rigorous) treatment of the geometry of curves.

Multilayer networks is a rising topic in Network Science which characterizes the structure and the function of complex systems formed by several interacting networks. Multilayer networks research has been propelled forward by the wide realm of applications in social, biological and infrastructure networks and the large availability of network data, as well as by the significance of recent results, which have produced important advances in this rapidly growing field. This book presents a comprehensive account of this emerging field. It provides a theoretical introduction to the main results of multilayer network science.

The interplay between combinatorics and theoretical physics is a recent trend which appears to us as particularly natural, since the unfolding of new ideas in physics is often tied to the development of combinatorial methods, and, conversely, problems in combinatorics have been successfully tackled using methods inspired by theoretical physics. We can thus speak nowadays of an emerging domain of Combinatorial Physics.The interference between these two disciplines is moreover an interference of multiple facets. Its best known manifestation (both to combinatorialists and theoretical physicists) has so far been the one between combinatorics and statistical physics, as statistical physics relies on an accurate counting of the various states or configurations of a physical system.But combinatorics and theoretical physics interact in various other ways. This book is mainly dedicated to the interactions of combinatorics (algebraic, enumerative, analytic) with (commutative and non-commutative) quantum field theory and tensor models, the latter being seen as a quantum field theoretical generalisation of matrix models.

Like the intriguing Fibonacci and Lucas numbers, Catalan numbers are also ubiquitous. "They have the same delightful propensity for popping up unexpectedly, particularly in combinatorial problems," Martin Gardner wrote in Scientific American. "Indeed, the Catalan sequence is probably the most frequently encountered sequence that is still obscure enough to cause mathematicians lacking access to Sloane's Handbook of Integer Sequences to expend inordinate amounts of energy re-discovering formulas that were worked out long ago," he continued. As Gardner noted, many mathematicians may know the abc's of Catalan sequence, but not many are familiar with the myriad of their unexpected occurrences, applications, and properties; they crop up in chess boards, computer programming, and even train tracks. This book presents a clear and comprehensive introduction to one of the truly fascinating topics in mathematics. Catalan numbers are named after the Belgian mathematician Eugene Charles Catalan (1814-1894), who "discovered" them in 1838, though he was not the first person to discover them. The great Swiss mathematician Leonhard Euler (1707-1763) "discovered" them around 1756, but even before then and though his work was not known to the outside world, Chinese mathematician Antu Ming (1692?-1763) first discovered Catalan numbers about 1730. A great source of fun for both amateurs and mathematicians, they can be used by teachers and professors to generate excitement among students for exploration and intellectual curiosity and to sharpen a variety of mathematical skills and tools, such as pattern recognition, conjecturing, proof-techniques, and problem-solving techniques. This book is not intended for mathematicians only but for a much larger audience, including high school students, math and science teachers, computer scientists, and those amateurs with a modicum of mathematical curiosity. An invaluable resource book, it contains an intriguing array of applications to computer science, abstract algebra, combinatorics, geometry, graph theory, chess, and world series.

In 1875, Elwin Bruno Christoffel introduced a special class of words on a binary alphabet linked to continued fractions which would go on to be known as Christoffel words. Some years later, Andrey Markoff published his famous theory, now called the Markoff theory. Markoff's theory characterized certain quadratic forms and real numbers by extremal inequalities. Both classes are constructed using certain natural numbers, known as Markoff numbers, and they form part of a solution to the Markoff Diophantine equation. More basically, they are constructed using certain words, essentially Christoffel words.The link between Christoffel words and Markoff's theory was noted by Ferdinand Frobenius in 1913, but has been neglected in recent times. Motivated by this overlooked connection, this book looks to expand on the relationship between these two areas. The first part of the book focuses on the classical theory of Markoff, while Part II explores the more advanced and recent results of the theory of Christoffel words. This new edition includes many additional exercises and solutions, as well as expanded sections on quadratic forms and quadratic numbers, two new chapters on standard words and the commutator subgroup, and revised results in combinatorics on words.

This is an extensively revised version of the very successfulCombinatorial Designs: Construction Methods which was published in 1990 by Ellis Horwood and is now out of print. A new chapter on league schedules is now included, dealing with round robin tournaments, venue sequences, and carry over effects. Balanced tournament designs, double schedules, and bridge tournament designs are also covered, and there is some material on whist tournaments.The presentation is clear and reable. Throughout, the historical development of the material is emphasized. There are plenty of examples and exercises giving detailed constructions, and a copious bibliography is provided. The author is internationally respected as an expositor, and this book provides an excellent text and reference book for researchers.

The matching problem is one of the central problems in graph theory as well as in the theory of algorithms and their applications. This book will provide the reader with a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph matching problems. The text is written for students at the beginning graduate level. The exposition is mostly self-contained and example-driven. Prerequisites have been kept to a minimum by including relevant background material. The book contains full details of several new techniques and should also be of interest to research workers in computer science, operations research, discrete mathematics, and electrical engineering. The main theoretical tools are combined into three independent chapters, devoted to combinatorial tools, probabilistic tools, and algebraic tools. One of the main goals of the book is to bring together these three approaches and highlight how their combination works in the development of efficient parallel algorithms. The reader will be provided with a simple and transparent presentation of a variety of interesting algorithms, including many examples and illustrations. The combination of different approaches makes the matching problem and its applications an attractive and fascinating subject. It is hoped that the book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas. Marek Karpinski is Chair Professor of Computer Science at the University of Bonn. Wojciech Rytter is Professor of Computer Science at the University of Warsaw and at the University of Liverpool.

This book provides a unique and unusual introduction to graph theory by one of the founding fathers, and will be of interest to all researchers in the subject. It is not intended as a comprehensive treatise, but rather as an account of those parts of the theory that have been of special interest to the author. Professor Tutte details his experience in the area, and provides a fascinating insight into how he was led to his theorems and the proofs he used. As well as being of historical interest it provides a useful starting point for research, with references to further suggested books as well as the original papers.The book starts by detailing the first problems worked on by Professor Tutte and his colleagues during his days as an undergraduate member of the Trinity Mathematical Society in Cambridge. It covers subjects such as comnbinatorial problems in chess, the algebraicization of graph theory, reconstruction of graphs, and the chromatic eigenvalues. In each case fascinating historical and biographical information about the author's research is provided.

This book is an account of the combinatorics of projective spaces over a finite field, with special emphasis on one and two dimensions. With its successor volumes, Finite projective spaces over three dimensions (1985), which is devoted to three dimensions, and General Galois geometries (1991), on a general dimension, it provides a comprehensive treatise of this area of mathematics. The area is interesting in itself, but is important for its applications to coding theory and statistics, and its use of group theory, algebraic geometry, and number theory. This edition is a complete reworking of the first edition. The chapters bear almost the same titles as the first edition, but every chapter has been changed. The most significant changes are to Chapters 2, 10, 12, 13, which respectively describe generalities, the geometry of arcs in ovals, the geometry of arcs of higher degree, and blocking sets. The book is divided into three parts. The first part comprises two chapters, the first of which is a survey of finite fields; the second outlines the fundamental properties of projective spaces and their automorphisms, as well as properties of algebraic varieties and curves, in particular, that are used in the rest of the book and the accompanying two volumes. Parts II and III are entirely self-contained; all proofs of results are given. The second part comprises Chapters 3 to 5. They cover, in an arbitrary dimension, the properties of subspaces such as their number and characterization, of partitions into both subspaces and subgeometries, and of quadrics and Hermitian varieties, as well as polarities. Part III is a detailed account of the line and the plane. In the plane, fundamental properties are first revisited without much resort to the generalities of Parts I and II. Then, the structure of arcs and their relation to curves is described; this includes arcs both of degree two and higher degrees. There are further chapters on blocking sets and on small planes, which means of orders up to thirteen. A comprehensive bibliography of more than 3000 items is provided. At the end of each chapter is a section, Notes and References, which attributes proofs, includes further comments, and lists every relevant reference from the bibliography.

This is a new and much expanded edition of Professor Macdonald's acclaimed monograph on Symmetric Functions and Hall Polynomials. Almost every chapter has new sections and many new examples have been included throughout. In addition there are two new chapters (6 and 7).Chapter 6 contains an extended account of a family of symmetric functions depending on two parameters. These symmetric functions include as particular cases many of those encountered earlier in the book and they also include, as a limiting case, Jack's symmetric functions depending on a parameter α. Many of the properties of the Schur functions generalize to these two-parameter symmetric functions.Chapter 7 is devoted to the study of the zxonal polynomials, long familiar to staticians. From one point of view, they are a special case of Jack's symmetric functions (the parameter α being equal to 2) but their combinatorial and group-theoretic connections make them worthy of study in their own right.

This monograph sets out a body of mathematical theory for finite graphs with nodes placed randomly in Euclidean space and edges added to connect points that are close to each other. As an alternative to classical random graph models, these geometric graphs are relevant to the modelling of real-world networks having spatial content, arising in numerous applications such as wireless communications, parallel processing, classification, epidemiology, astronomy, and the internet. Aimed at graduate students and researchers in probability, combinatorics, statistics, and theoretical computer science, it covers topics such as edge and component counts, vertex degrees, cliques, colourings, connectivity, giant component phenomena, vertex ordering and partitioning problems. It also illustrates and extends the application to geometric probability of modern techniques including Stein's method, martingale methods and continuum percolation.