Graph Searching Games and Probabilistic Methods 1st Edition Bonato pdf download
Graph Searching Games and Probabilistic Methods 1st Edition Bonato pdf download
https://textbookfull.com/product/graph-searching-games-and-
probabilistic-methods-1st-edition-bonato/
https://textbookfull.com/product/algorithms-and-models-for-the-
web-graph-anthony-bonato/
https://textbookfull.com/product/probabilistic-theory-of-mean-
field-games-with-applications-i-mean-field-fbsdes-control-and-
games-1st-edition-rene-carmona/
https://textbookfull.com/product/reliability-engineering-
probabilistic-models-and-maintenance-methods-second-edition-
nachlas/
https://textbookfull.com/product/reliability-engineering-
probabilistic-models-and-maintenance-methods-second-edition-
nachlas-2/
Methods for Studying Video Games and Religion 1st
Edition Vít Šisler
https://textbookfull.com/product/methods-for-studying-video-
games-and-religion-1st-edition-vit-sisler/
https://textbookfull.com/product/polymorphism-in-java-methods-
and-polymorphic-algorithms-applied-to-computer-games-1st-edition-
privitera/
https://textbookfull.com/product/graph-theory-and-
decomposition-1st-edition-kottarathil/
https://textbookfull.com/product/probabilistic-methods-in-
geotechnical-engineering-proceedings-of-the-conference-
canberra-10-12-february-1993-first-edition-li/
https://textbookfull.com/product/fuzzy-graph-theory-1st-edition-
sunil-mathew/
Graph Searching Games and
Probabilistic Methods
DISCRETE
MATHEMATICS
AND
ITS APPLICATIONS
Series Editors
Miklos Bona
Patrice Ossona de Mendez
Douglas West
R. B. J. T. Allenby and Alan Slomson, How to Count: An Introduction to Combinatorics,
Third Edition
Craig P. Bauer, Secret History: The Story of Cryptology
Jürgen Bierbrauer, Introduction to Coding Theory, Second Edition
Katalin Bimbó, Combinatory Logic: Pure, Applied and Typed
Katalin Bimbó, Proof Theory: Sequent Calculi and Related Formalisms
Donald Bindner and Martin Erickson, A Student’s Guide to the Study, Practice, and Tools of
Modern Mathematics
Francine Blanchet-Sadri, Algorithmic Combinatorics on Partial Words
Miklós Bóna, Combinatorics of Permutations, Second Edition
Miklós Bóna, Handbook of Enumerative Combinatorics
Miklós Bóna, Introduction to Enumerative and Analytic Combinatorics, Second Edition
Anthony Bonato and Pralat Pawel, Graph Searching Games and Probabilistic Methods
Jason I. Brown, Discrete Structures and Their Interactions
Richard A. Brualdi and Dragos̆ Cvetković, A Combinatorial Approach to Matrix Theory and Its
Applications
Kun-Mao Chao and Bang Ye Wu, Spanning Trees and Optimization Problems
Charalambos A. Charalambides, Enumerative Combinatorics
Gary Chartrand and Ping Zhang, Chromatic Graph Theory
Henri Cohen, Gerhard Frey, et al., Handbook of Elliptic and Hyperelliptic Curve Cryptography
Charles J. Colbourn and Jeffrey H. Dinitz, Handbook of Combinatorial Designs, Second Edition
Titles (continued)
Abhijit Das, Computational Number Theory
Matthias Dehmer and Frank Emmert-Streib, Quantitative Graph Theory:
Mathematical Foundations and Applications
Martin Erickson, Pearls of Discrete Mathematics
Martin Erickson and Anthony Vazzana, Introduction to Number Theory
Steven Furino, Ying Miao, and Jianxing Yin, Frames and Resolvable Designs: Uses,
Constructions, and Existence
Mark S. Gockenbach, Finite-Dimensional Linear Algebra
Randy Goldberg and Lance Riek, A Practical Handbook of Speech Coders
Jacob E. Goodman and Joseph O’Rourke, Handbook of Discrete and Computational Geometry,
Third Edition
Jonathan L. Gross, Combinatorial Methods with Computer Applications
Jonathan L. Gross and Jay Yellen, Graph Theory and Its Applications, Second Edition
Jonathan L. Gross, Jay Yellen, and Ping Zhang Handbook of Graph Theory, Second Edition
David S. Gunderson, Handbook of Mathematical Induction: Theory and Applications
Richard Hammack, Wilfried Imrich, and Sandi Klavžar, Handbook of Product Graphs,
Second Edition
Darrel R. Hankerson, Greg A. Harris, and Peter D. Johnson, Introduction to Information Theory
and Data Compression, Second Edition
Darel W. Hardy, Fred Richman, and Carol L. Walker, Applied Algebra: Codes, Ciphers, and
Discrete Algorithms, Second Edition
Daryl D. Harms, Miroslav Kraetzl, Charles J. Colbourn, and John S. Devitt, Network Reliability:
Experiments with a Symbolic Algebra Environment
Silvia Heubach and Toufik Mansour, Combinatorics of Compositions and Words
Leslie Hogben, Handbook of Linear Algebra, Second Edition
Derek F. Holt with Bettina Eick and Eamonn A. O’Brien, Handbook of Computational Group Theory
David M. Jackson and Terry I. Visentin, An Atlas of Smaller Maps in Orientable and
Nonorientable Surfaces
Richard E. Klima, Neil P. Sigmon, and Ernest L. Stitzinger, Applications of Abstract Algebra
with Maple™ and MATLAB®, Second Edition
Richard E. Klima and Neil P. Sigmon, Cryptology: Classical and Modern with Maplets
Patrick Knupp and Kambiz Salari, Verification of Computer Codes in Computational Science
and Engineering
William L. Kocay and Donald L. Kreher, Graphs, Algorithms, and Optimization, Second Edition
Donald L. Kreher and Douglas R. Stinson, Combinatorial Algorithms: Generation Enumeration
and Search
Titles (continued)
Anthony Bonato
Pralat Pawel
CRC Press
Taylor & Francis Group
6000 Broken Sound Parkway NW, Suite 300
Boca Raton, FL 33487-2742
This book contains information obtained from authentic and highly regarded sources. Reasonable
efforts have been made to publish reliable data and information, but the author and publisher cannot
assume responsibility for the validity of all materials or the consequences of their use. The authors and
publishers have attempted to trace the copyright holders of all material reproduced in this publication
and apologize to copyright holders if permission to publish in this form has not been obtained. If any
copyright material has not been acknowledged please write and let us know so we may rectify in any
future reprint.
Except as permitted under U.S. Copyright Law, no part of this book may be reprinted, reproduced,
transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or
hereafter invented, including photocopying, microfilming, and recording, or in any information
storage or retrieval system, without written permission from the publishers.
For permission to photocopy or use material electronically from this work, please access
www.copyright.com (http://www.copyright.com/) or contact the Copyright Clearance Center, Inc.
(CCC), 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400. CCC is a not-for-profit organization
that provides licenses and registration for a variety of users. For organizations that have been granted
a photocopy license by the CCC, a separate system of payment has been arranged.
Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and
are used only for identification and explanation without intent to infringe.
Visit the Taylor & Francis Web site at
http://www.taylorandfrancis.com
and the CRC Press Web site at
http://www.crcpress.com
Contents
Preface xix
1 Introduction 1
1.1 Graphs . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Probability . . . . . . . . . . . . . . . . . . . . . . 7
1.3 Asymptotic Notation and Useful Inequalities . . . 12
1.4 Random Graphs . . . . . . . . . . . . . . . . . . . 15
1.5 Tools: First and Second Moment Methods . . . . . 17
1.6 Tools: Chernoff Bounds . . . . . . . . . . . . . . . 23
ix
x Contents
8 Firefighting 231
8.1 Tool: Expander Mixing Lemma . . . . . . . . . . . 233
8.2 The k = 1 Case . . . . . . . . . . . . . . . . . . . . 234
8.3 The k > 1 Case . . . . . . . . . . . . . . . . . . . . 239
8.4 Fighting Constrained Fires in Graphs . . . . . . . 247
Bibliography 357
Index 375
List of Figures
xiii
xiv List of Figures
xvii
Preface
xix
xx Preface
1
2 Graph Searching Games and Probabilistic Methods
1.1 Graphs
Graphs are our main objects of study. For further background
in graph theory, the reader is directed to any of the texts [34, 76,
180].
A graph G = (V, E) is a pair consisting of a vertex set V =
V (G), an edge set E = E(G) consisting of pairs of vertices. Note
that E is taken as a multiset, as its elements may occur more than
once. We write uv if u and v form an edge, and say that u and
v are adjacent or joined. For consistency, we will use the former
term only. We refer to u and v as endpoints of the edge uv. The
order of a graph is |V (G)|, and its size is |E(G)|. Graphs are often
depicted by their drawings; see Figure 1.2.
✉
❅
❅
❅
❅
❅
✉ ❅✉
❅
❅
❅
❅
❅
❅✉
cs sc
❅
❅
❅
as ❅s d as sd
❅
❅
❅
s ❅s
G b b G
E = {xy : x ∈ X, y ∈ Y }.
G[V ′ ] = (V ′ , {uv ∈ E : u, v ∈ V ′ })
4 Graph Searching Games and Probabilistic Methods
t t t t
❅ ❅
t t ❅
❅t t ❅
❅t t
❅ ❅
❅
❅t t t ❅
❅t t
FIGURE 1.5: The line graph of the Petersen graph (see Figure 1.3).
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
textbookfull.com