Extremal Finite Set Theory (Discrete Mathematics and Its Applications) - Image 1

£45.85

Chapman and Hall/CRC Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Name: Extremal Finite Set Theory (Discrete Mathematics and Its Applications)
Brand: Chapman and Hall/CRC
Price: 45.85 GBP
Availability: InStock

Combinatorics & Graph Theory

This is the usual price. Wait for it to drop, or tell us your number.

£46 today · usual range £0–£0 · best ever £39

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 625 days • 625 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 625 days • 8 price levels

Days at Price

Current Price

Price Analysis

Most common price: £43 (261 days, 41.8%)

Price range: £39 - £47

Price levels: 8 different prices over 625 days

Description

Extremal Finite Set Theory surveys old and new results in the area of extremal set system theory. It presents an overview of the main techniques and tools (shifting, the cycle method, profile polytopes, incidence matrices, flag algebras, etc.) used in the different subtopics. The book focuses on the cardinality of a family of sets satisfying certain combinatorial properties. It covers recent progress in the subject of set systems and extremal combinatorics. Intended for graduate students, instructors teaching extremal combinatorics and researchers, this book serves as a sound introduction to the theory of extremal set systems. In each of the topics covered, the text introduces the basic tools used in the literature. Every chapter provides detailed proofs of the most important results and some of the most recent ones, while the proofs of some other theorems are posted as exercises with hints. Features: Presents the most basic theorems on extremal set systems Includes many proof techniques Contains recent developments The book’s contents are well suited to form the syllabus for an introductory course About the Authors: Dániel Gerbner is a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences in Budapest, Hungary. He holds a Ph.D. from Eötvös Loránd University, Hungary and has contributed to numerous publications. His research interests are in extremal combinatorics and search theory. Balázs Patkós is also a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences. He holds a Ph.D. from Central European University, Budapest and has authored several research papers. His research interests are in extremal and probabilistic combinatorics.

Product Specifications

Brand: Chapman and Hall/CRC
Format: paperback
ASIN: 1032476001
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Combinatorics & Graph Theory
Domain: Amazon UK
Release Date: 21 January 2023
Listed Since: 01 December 2022

Barcode

No barcode data available

Chapman and Hall/CRC Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Mathematics via Problems: Part 3: Combinatorics: 29 (MSRI Mathematical Circles Library)

A First Course in Enumerative Combinatorics (Pure and Applied Undergraduate Texts)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Combinatorial Nullstellensatz: With Applications to Graph Colouring (CRC Focus)

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Geometric Combinatorics (IAS/Park City Mathematics) (IAS/Park City Mathematics Series)

Finite and Infinite Combinatorics in Sets and Logic: 411 (Nato Science Series C:, 411)

Extremal Problems for Finite Sets (Student Mathematical Library)

Analytic Combinatorics: A Multidimensional Approach (Discrete Mathematics and Its Applications)

A Path to Combinatorics for Undergraduates: Counting Strategies

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

The Mathematics of Paul Erdős II

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

Surveys in Combinatorics 2021 (London Mathematical Society Lecture Note Series)

Algebraic Combinatorics: Walks, Trees, Tableaux, and More (Undergraduate Texts in Mathematics)

The Mathematics of Paul Erdős II: 2

Sampling in Combinatorial and Geometric Set Systems (Mathematical Surveys and Monographs)

Combinatorics of Permutations (Discrete Mathematics and Its Applications)

Building Bridges II: Mathematics of László Lovász: 28 (Bolyai Society Mathematical Studies, 28)

Chapman and Hall/CRC Handbook of Enumerative Combinatorics

Combinatorial and Algorithmic Mathematics: From Foundation to Optimization

Irregularities of Partitions: 8 (Algorithms and Combinatorics, 8)