An edition of Extremal Combinatorics (2001)

Extremal Combinatorics

With Applications in Computer Science

  • 1 Want to read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 1 Want to read

Buy this book

Last edited by ImportBot
February 27, 2022 | History
An edition of Extremal Combinatorics (2001)

Extremal Combinatorics

With Applications in Computer Science

  • 1 Want to read

The book is a concise, self-contained and up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called gems of the theory. A wide spectrum of most powerful combinatorial tools is presented: methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A throughout discussion of some recent applications to computer science motivates the liveliness and inherent usefulness of these methods to approach problems outside combinatorics. No special combinatorial or algebraic background is assumed. All necessary elements of linear algebra and discrete probability are introduced before their combinatorial applications. Aimed primarily as an introductory text for graduates, it provides also a compact source of modern extremal combinatorics for researchers in computer science and other fields of discrete mathematics.

Publish Date
Language
English
Pages
378

Buy this book

Previews available in: English

Edition Availability
Cover of: Extremal Combinatorics
Extremal Combinatorics: With Applications in Computer Science
2013, Springer Berlin / Heidelberg
in English
Cover of: Extremal Combinatorics
Extremal Combinatorics: With Applications in Computer Science
Sep 10, 2011, Springer
paperback
Cover of: Extremal Combinatorics
Extremal Combinatorics: With Applications in Computer Science
2001, Springer Berlin Heidelberg
electronic resource : in English

Add another edition?

Book Details


Table of Contents

Introduction
I. The Classis: Counting
The Pigeon-Hole Principle
Principle of Inclusion and Exclusion
Systems of Distinct Representatives
Colorings
Chains and Antichains
Intersecting Families
Covers and Transversals
Sunflowers
Density and Universality
Designs
Witness Sets
Isolation Lemmas
II. The Linear Algebra Method: Basic Method
The Polynomial Technique
Monotone Span Programs
III. The Probabilistic Method: Basic Tools
Counting Sieve
Lovász Sieve
Linearity of Expectation
The Deletion Method
Second Moment Method
Bounding of Large Deviations
Randomized Algorithms
Derandomization
The Entropy Function
Random Walks and Search Problems
IV. Fragments of Ramsey Theory: Ramsey's Theorem
The Hales-Jewett Theorem
Epilogue: What Next?- Bibliography
Index.

Edition Notes

Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.

Published in
Berlin, Heidelberg
Series
Texts in Theoretical Computer Science. An EATCS Series, Texts in Theoretical Computer Science. An EATCS Series

Classifications

Dewey Decimal Class
004.0151
Library of Congress
QA76.9.M35

The Physical Object

Format
[electronic resource] :
Pagination
1 online resource (xvii, 378 p.)
Number of pages
378

ID Numbers

Open Library
OL27037970M
Internet Archive
extremalcombinat00jukn_705
ISBN 10
3642085598, 3662046504
ISBN 13
9783642085598, 9783662046500
OCLC/WorldCat
851373430

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
February 27, 2022 Edited by ImportBot import existing book
June 30, 2019 Created by MARC Bot Imported from Internet Archive item record