Combinatorics: A Problem-Based Approach / by Pavle Mladenovic.

By:

Mladenovic, Pavle [author.]

Material type: Text

TextSeries: Problem Books in MathematicsPublication details: Cham : Springer International Publishing : 2019.Description: x, 365 pages 98 illustrations, 24 cmISBN:

9783030008307 (hbk.)

Subject(s):

DDC classification:

511.6 MLA 23

Summary: This text provides a theoretical background for several topics in combinatorial mathematics, such as enumerative combinatorics (including partitions and Burnside's lemma), magic and Latin squares, graph theory, extremal combinatorics, mathematical games and elementary probability. A number of examples are given with explanations while the book also provides more than 300 exercises of different levels of difficulty that are arranged at the end of each chapter, and more than 130 additional challenging problems, including problems from mathematical olympiads. Solutions or hints to all exercises and problems are included. The book can be used by secondary school students preparing for mathematical competitions, by their instructors, and by undergraduate students. The book may also be useful for graduate students and for researchers that apply combinatorial methods in different areas.

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Books	H.T. Parekh Library	SIAS Collection	511.6 MLA (Browse shelf(Opens below))	Available		K3616

Browsing H.T. Parekh Library shelves, Collection: SIAS Collection Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.6 ALO Probabilistic method /	511.6 BON Walk through combinatorics: an introduction to enumeration and graph theory /	511.6 LIN Course in combinatorics /	511.6 MLA Combinatorics: A Problem-Based Approach /	511.6 OXL Matroid theory /	511.6 PEN Combinatorics of train tracks /	511.6 RIO Introduction to combinatorial analysis /	Next

Euro : 54.99/-
TBH86/45

This text provides a theoretical background for several topics in combinatorial mathematics, such as enumerative combinatorics (including partitions and Burnside's lemma), magic and Latin squares, graph theory, extremal combinatorics, mathematical games and elementary probability. A number of examples are given with explanations while the book also provides more than 300 exercises of different levels of difficulty that are arranged at the end of each chapter, and more than 130 additional challenging problems, including problems from mathematical olympiads. Solutions or hints to all exercises and problems are included. The book can be used by secondary school students preparing for mathematical competitions, by their instructors, and by undergraduate students. The book may also be useful for graduate students and for researchers that apply combinatorial methods in different areas.

Description based on publisher-supplied MARC data.

There are no comments on this title.

to post a comment.