menu
{ "item_title" : "Extremal Combinatorics", "item_author" : [" Stasys Jukna "], "item_description" : "Preface.- Prolog: What this Book Is About.- Notation.- Counting.- Advanced Counting.- Probabilistic Counting.- The Pigeonhole Principle.- Systems of Distinct Representatives.- Sunflowers.- Intersecting Families.- Chains and Antichains.- Blocking Sets and the Duality.- Density and Universality.- Witness Sets and Isolation.- Designs.- The Basic Method.- Orthogonality and Rank Arguments.- Eigenvalues and Graph Expansion.- The Polynomial Method.- Combinatorics of Codes.- Linearity of Expectation.- The Lov sz Sieve.- The Deletion Method.- The Second Moment Method.- The Entropy Function.- Random Walks.- Derandomization.- Ramseyan Theorems for Numbers.- The Hales-Jewett Theorem.- Applications in Communications Complexity.- References.- Index.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/64/217/363/3642173632_b.jpg", "price_data" : { "retail_price" : "109.00", "online_price" : "109.00", "our_price" : "109.00", "club_price" : "109.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Extremal Combinatorics|Stasys Jukna

Extremal Combinatorics : With Applications in Computer Science

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Preface.- Prolog: What this Book Is About.- Notation.- Counting.- Advanced Counting.- Probabilistic Counting.- The Pigeonhole Principle.- Systems of Distinct Representatives.- Sunflowers.- Intersecting Families.- Chains and Antichains.- Blocking Sets and the Duality.- Density and Universality.- Witness Sets and Isolation.- Designs.- The Basic Method.- Orthogonality and Rank Arguments.- Eigenvalues and Graph Expansion.- The Polynomial Method.- Combinatorics of Codes.- Linearity of Expectation.- The Lov sz Sieve.- The Deletion Method.- The Second Moment Method.- The Entropy Function.- Random Walks.- Derandomization.- Ramseyan Theorems for Numbers.- The Hales-Jewett Theorem.- Applications in Communications Complexity.- References.- Index.

This item is Non-Returnable

Details

  • ISBN-13: 9783642173639
  • ISBN-10: 3642173632
  • Publisher: Springer
  • Publish Date: September 2011
  • Dimensions: 9.21 x 6.14 x 0.94 inches
  • Shipping Weight: 1.73 pounds
  • Page Count: 412

Related Categories

You May Also Like...

    1

BAM Customer Reviews