Extremal Combinatorics: With Applications in Computer Science
Jukna, Stasys
Sold by tcyBooks, Brooklyn, NY, U.S.A.
AbeBooks Seller since November 16, 2025
New - Soft cover
Condition: New
Ships within U.S.A.
Quantity: 1 available
Add to basketSold by tcyBooks, Brooklyn, NY, U.S.A.
AbeBooks Seller since November 16, 2025
Condition: New
Quantity: 1 available
Add to basketPreface.- 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.
"About this title" may belong to another edition of this title.
| Order quantity | 5 to 14 business days | 3 to 6 business days |
|---|---|---|
| First item | US$ 4.75 | US$ 14.00 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.