Combinatorics : a problem based approach
Material type:
TextLanguage: ENGLISH Series: Problem Books in MathematicsPublication details: Switzerland : Springer Nature, 2019. Description: x, 365p. : 98 illustrationsISBN: 9783030008307Subject(s): Combinatorics | Graph theory | Enumerative combinatorics | Mathematical olympiadsDDC classification: 519.1 Online resources: Table of contents | Reviews 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.
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Book
|
NISER LIBRARY | 519.1 MLA-C (Browse shelf(Opens below)) | Available | 25266 |
Browsing NISER LIBRARY shelves Close shelf browser (Hides shelf browser)
| No cover image available | ||||||||
| 519.1 BAB-G Graph products and the vizing's conjecture | 519.1 GER-C Combinatorial group theory and topology | 519.1 KAS-P Physical combinatorics | 519.1 MLA-C Combinatorics : a problem based approach | 519.1 PAP-C Combinatorial optimization:algorithms and complexity | 519.1 PAP-C Combinatorial optimization:algorithms and complexity | 519.1 PAP-C Combinatorial optimization:algorithms and complexity |
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.
There are no comments on this title.