The new 6th edition of Applied Combinatorics builds on the previous editions with more in depth analysis of computer systems in order to help develop proficiency in basic discrete math problem solving.

As one of the most widely used book in combinatorial problems, this edition explains how to reason and model combinatorically while stressing the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity. Although important uses of combinatorics in computer science, operations research, and finite probability are mentioned, these applications are often used solely for motivation. Numerical examples involving the same concepts use more interesting settings such as poker probabilities or logical games.

This book is designed for use by students with a wide range of ability and maturity (sophomores through beginning graduate students). The stronger the students, the harder the exercises that can be assigned. The book can be used for one-quarter, two-quarter, or one-semester course depending on how much material is used.

* What is the essence of the similarity between linearly independent sets of columns of a matrix and forests in a graph?
* Why does the greedy algorithm produce a spanning tree of minimum weight in a connected graph?
* Can we test in polynomial time whether a matrix is totally unimodular?
Matroid theory examines and answers questions like these. Seventy-five years of study of matroids has seen the development of a rich theory with links to graphs, lattices, codes, transversals, and projective geometries. Matroids are of fundamental importance in combinatorial optimization and their applications extend into electrical and structural engineering.
This book falls into two parts: the first provides a comprehensive introduction to the basics of matroid theory, while the second treats more advanced topics. The book contains over seven hundred exercises and includes, for the first time in one place, proofs of all of the major theorems in the subject. The last two chapters review current research and list more than eighty unsolved problems along with a description of the progress towards their solutions.
Reviews from previous edition:
"It includes more background, such as finite fields and finite projective and affine geometries, and the level of the exercises is well suited to graduate students. The book is well written and includes a couple of nice touches ... this is a very useful book. I recommend it highly both as an introduction to matroid theory and as a reference work for those already seriously interested in the subject, whether for its own sake or for its applications to other fields." -- AMS Bulletin
"Whoever wants to know what is happening in one of the most exciting chapters of combinatorics has no choice but to buy and peruse Oxley's treatise." -- The Bulletin of Mathematics
"This book is an excellent graduate textbook and reference book on matroid theory. The care that went into the writing of this book is evident by the quality of the exposition." -- Mathematical Reviews

This book is a unique introduction to graph theory, written by one of its founding fathers. 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 experiences in the area, and provides a fascinating insight into the processes leading to his proofs.

While the significance of networks in various human behavior and activities has a history as long as human's existence, network awareness is a recent scientific phenomenon. The neologism network science is just one or two decades old. Nevertheless, with this limited time, network thinking has substantially reshaped the recent development in economics, and almost all solutions to real-world problems involve the network element. This book integrates agent-based modeling and network science. It is divided into three parts, namely, foundations, primary dynamics on and of social networks, and applications. The authors begin with the network origin of agent-based models, known as cellular automata, and introduce a number of classic models, such as Schelling's segregation model and Axelrod's spatial game. The essence of the foundation part is the network-based agent-based models in which agents follow network-based decision rules. Under the influence of the substantial progress in network science in late 1990s, these models have been extended from using lattices into using small-world networks, scale-free networks, etc. The text also shows that the modern network science mainly driven by game-theorists and sociophysicists has inspired agent-based social scientists to develop alternative formation algorithms, known as agent-based social networks. It reviews a number of pioneering and representative models in this family. Upon the given foundation, the second part reviews three primary forms of network dynamics, such as diffusions, cascades, and influences. These primary dynamics are further extended and enriched by practical networks in goods-and-service markets, labor markets, and international trade. At the end, the book considers two challenging issues using agent-based models of networks: network risks and economic growth.

In the world of mathematics and computer science, technological advancements are constantly being researched and applied to ongoing issues. Setbacks in social networking, engineering, and automation are themes that affect everyday life, and researchers have been looking for new techniques in which to solve these challenges. Graph theory is a widely studied topic that is now being applied to real-life problems. Advanced Applications of Graph Theory in Modern Society is an essential reference source that discusses recent developments on graph theory, as well as its representation in social networks, artificial neural networks, and many complex networks. The book aims to study results that are useful in the fields of robotics and machine learning and will examine different engineering issues that are closely related to fuzzy graph theory. Featuring research on topics such as artificial neural systems and robotics, this book is ideally designed for mathematicians, research scholars, practitioners, professionals, engineers, and students seeking an innovative overview of graphic theory.

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.

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.

MESH ist ein mathematisches Video ber vielfl chige Netzwerke und ihre Rolle in der Geometrie, der Numerik und der Computergraphik. Der unter Anwendung der neuesten Technologie vollst ndig computergenierte Film spannt einen Bogen von der antiken griechischen Mathematik zum Gebiet der heutigen geometrischen Modellierung. MESH hat zahlreiche wissenschaftliche Preise weltweit gewonnen. Die Autoren sind Konrad Polthier, ein Professor der Mathematik, und Beau Janzen, ein professioneller Filmdirektor.

Der Film ist ein ausgezeichnetes Lehrmittel f r Kurse in Geometrie, Visualisierung, wissenschaftlichem Rechnen und geometrischer Modellierung an Universit ten, Zentren f r wissenschaftliches Rechnen, kann jedoch auch an Schulen genutzt werden.

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.

This book is the essential companion to Counting (2nd Edition) (World Scientific, 2013), an introduction to combinatorics for secondary to undergraduate students. The book gives solutions to the exercises in Counting (2nd Edition). There is often more than one method to solve a particular problem and the authors have included alternative solutions whenever they are of interest. The rigorous and clear solutions will aid the reader in further understanding the concepts and applications in Counting (2nd Edition). An introductory section on problem solving as described by George P lya will be useful in helping the lay person understand how mathematicians think and solve problems.

This book in its Second Edition is a useful, attractive introduction to basic counting techniques for upper secondary to undergraduate students, as well as teachers. Younger students and lay people who appreciate mathematics, not to mention avid puzzle solvers, will also find the book interesting. The various problems and applications here are good for building up proficiency in counting. They are also useful for honing basic skills and techniques in general problem solving. Many of the problems avoid routine and the diligent reader will often discover more than one way of solving a particular problem, which is indeed an important awareness in problem solving. The book thus helps to give students an early start to learning problem-solving heuristics and thinking skills.New chapters originally from a supplementary book have been added in this edition to substantially increase the coverage of counting techniques. The new chapters include the Principle of Inclusion and Exclusion, the Pigeonhole Principle, Recurrence Relations, the Stirling Numbers and the Catalan Numbers. A number of new problems have also been added to this edition.

Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of "magic" ideas have been applied to graphs. Recently there has been a resurgence of interest in "magic labelings" due to a number of results that have applications to the problem of decomposing graphs into trees.

Key features of this second edition include:

. a new chapter on magic labeling of directed graphs

. applications of theorems from graph theory and interesting counting arguments

. new research problems and exercises covering a range of difficulties

. a fully updated bibliography and index

This concise, self-contained exposition is unique in its focus on the theory of magic graphs/labelings. It may serve as a graduate or advanced undergraduate text for courses in mathematics or computer science, and as reference for the researcher."

Graphs and Networks A unique blend of graph theory and network science for mathematicians and data science professionals alike. Featuring topics such as minors, connectomes, trees, distance, spectral graph theory, similarity, centrality, small-world networks, scale-free networks, graph algorithms, Eulerian circuits, Hamiltonian cycles, coloring, higher connectivity, planar graphs, flows, matchings, and coverings, Graphs and Networks contains modern applications for graph theorists and a host of useful theorems for network scientists. The book begins with applications to biology and the social and political sciences and gradually takes a more theoretical direction toward graph structure theory and combinatorial optimization. A background in linear algebra, probability, and statistics provides the proper frame of reference. Graphs and Networks also features: Applications to neuroscience, climate science, and the social and political sciences A research outlook integrated directly into the narrative with ideas for students interested in pursuing research projects at all levels A large selection of primary and secondary sources for further reading Historical notes that hint at the passion and excitement behind the discoveries Practice problems that reinforce the concepts and encourage further investigation and independent work

Secret sharing schemes form one of the most important topic in Cryptography. These protocols are used in many areas, applied mathematics, computer science, electrical engineering. A secret is divided into several pieces called shares. Each share is given to a user of the system. Each user has no information about the secret, but the secret can be retrieved by certain authorized coalition of users.This book is devoted to such schemes inspired by Coding Theory. The classical schemes of Shamir, Blakley, Massey are recalled. Survey is made of research in Combinatorial Coding Theory they triggered, mostly self-dual codes, and minimal codes. Applications to engineering like image processing, and key management of MANETs are highlighted.

This two-volume set presents combinatorial functional equations using an algebraic approach, and illustrates their applications in combinatorial maps, graphs, networks, etc. The first volume mainly presents basic concepts and the theoretical background. Differential (ordinary and partial) equations and relevant topics are discussed in detail.

A magician appears able to banish chaos at will: a deck of cards arranged in order is shuffled--apparently randomly--by a member of the audience. Then, hey presto! The deck is suddenly put back in its original order! Magic tricks like this are easy to perform and have an interesting mathematical foundation. In this rich, colorfully illustrated volume, Ehrhard Behrends presents around 30 card tricks and number games that are easy to learn, with no prior knowledge required. This is math as you've never experienced it before: entertaining and fun!

A mathematical gem–freshly cleaned and polished

This book is intended to be used as the text for a first course in combinatorics. the text has been shaped by two goals, namely, to make complex mathematics accessible to students with a wide range of abilities, interests, and motivations; and to create a pedagogical tool, useful to the broad spectrum of instructors who bring a variety of perspectives and expectations to such a course.

Features retained from the first edition:

• Lively and engaging writing style
• Timely and appropriate examples
• Numerous well-chosen exercises
• Flexible modular format
• Optional sections and appendices

Highlights of Second Edition enhancements:

• Smoothed and polished exposition, with a sharpened focus on key ideas
• Expanded discussion of linear codes
• New optional section on algorithms
• Greatly expanded hints and answers section
• Many new exercises and examples

This book comprehensively covers the important efforts in improving the quality of images in visual cryptography (VC), with a focus on cases with gray scale images. It not only covers schemes in traditional VC and extended VC for binary secret images, but also the latest development in the analysis-by-synthesis approach. This book distinguishes itself from the existing literature in three ways. First, it not only reviews traditional VC for binary secret images, but also covers recent efforts in improving visual quality for gray scale secret images. Second, not only traditional quality measures are reviewed, but also measures that were not used for measuring perceptual quality of decrypted secret images, such as Radially Averaged Power Spectrum Density (RAPSD) and residual variance, are employed for evaluating and guiding the design of VC algorithms. Third, unlike most VC books following a mathematical formal style, this book tries to make a balance between engineering intuition and mathematical reasoning. All the targeted problems and corresponding solutions are fully motivated by practical applications and evaluated by experimental tests, while important security issues are presented as mathematical proof. Furthermore, important algorithms are summarized as pseudocodes, thus enabling the readers to reproduce the results in the book. Therefore, this book serves as a tutorial for readers with an engineering background as well as for experts in related areas to understand the basics and research frontiers in visual cryptography.

Modern Applications of Graph Theory discusses many cutting-edge applications of graph theory, such as traffic networks, navigable networks and optimal routing for emergency response, placement of electric vehicle charging stations, and graph-theoretic methods in molecular epidemiology. Due to the rapid growth of research in this field, the focus of the book is on the up-to-date development of these applications and the mathematical methods used to tackle them. Ideal for researchers, engineers, transport planners and emergency response specialists who are interested in graph theory applications, Modern Applications of Graph Theory can also be used as teaching material. In addition to up-to-date descriptions of the applications, it includes extensive exercises and their solutions, mimicking practical, real-life situations. Furthermore, there is an introductory chapter, which provides an overview of basic applications and algorithms of graph theory. The book includes over 120 illustrations and tables.

Algebraic combinatorics is the study of combinatorial objects as an extension of the study of finite permutation groups, or, in other words, group theory without groups. In the spirit of Delsarte's theory, this book studies combinatorial objects such as graphs, codes, designs, etc. in the general framework of association schemes, providing a comprehensive overview of the theory as well as pointing out to extensions.

Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond. Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs. Long-standing problems are surveyed and presented along with recent results in classical labelings. In addition, the book covers an assortment of variations on the labeling theme, all in one self-contained monograph. Assuming only basic familiarity with graphs, this book, complete with carefully written proofs of most results, is an ideal introduction to graph labeling for students learning the subject. More than 150 open problems and conjectures make it an invaluable guide for postgraduate and early career researchers, as well as an excellent reference for established graph theorists.

Elwyn Berlekamp, John Conway, and Richard Guy wrote 'Winning Ways for your Mathematical Plays' and turned a recreational mathematics topic into a full mathematical fi eld. They combined set theory, combinatorics, codes, algorithms, and a smattering of other fi elds, leavened with a liberal dose of humor and wit. Their legacy is a lively fi eld of study that still produces many surprises. Despite being experts in other areas of mathematics, in the 50 years since its publication, they also mentored, talked, and played games, giving their time, expertise, and guidance to several generations of mathematicians. This volume is dedicated to Elwyn Berlekamp, John Conway, and Richard Guy. It includes 20 contributions from colleagues that refl ect on their work in combinatorial game theory.

This manual contains solutions to odd-numbered Section Exercises, selected Chapter Review Exercises, odd-numbered Discussion Exercises and all Chapter Test Exercises--giving you a way to check your answers and ensure that you took the correct steps to arrive at an answer.