Extremal Combinatorics

Name: Extremal Combinatorics
Brand: Springer Nature
SKU: 9783642173639
Availability: InStock

Best Price:
Buy Extremal Combinatorics for $54.99 at @ Link.springer.com
No coupon is required — this is the standard retail price.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $54.99 - $54.99

BEST PRICE

Single Product Purchase

$54.99

@ Link.springer.com BUY Now

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$54.99	$54.99			$54.99		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783642173639

Condition

New

Product Description

This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text. This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the KruskalKatona theorem on shadows, the LovszStein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovsz Local Lemma, Schning's algorithm for 3-SAT, the SzemerdiTrotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.

Available Colors

N/A

Available Sizes

N/A