Combinatorial Extremization : In Mathematical Olympiad and Competitions
By: Feng, Yuefeng.
Material type:
Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
Mathematics | Book | 511.6/Fen (Browse shelf) | Available | 24054 |
Browsing HBCSE Shelves , Shelving location: Mathematics , Collection code: Book Close shelf browser
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
511.5/Cio/Mur A First Course In Graph Theory And Combinatorics | 511.5/Cla/Hol A First Look At Graph Theory | 511.5/Die Graph Theory | 511.6/Fen Combinatorial Extremization | 511.6/Kri Combinatorics Theory And Applications | 511.6/Tuc Applied Combinatorics | 511.6076/ Lov Combinatorial Problems And Exercises |
This book is part of the Mathematical Olympiad Series which discusses several aspects related to maths contests, such as algebra, number theory, combinatorics, graph theory and geometry. The book elaborates on methods of discrete extremization, such as inequality control, repeated extremum, partial adjustment, exploiting symmetry, polishing transform, space estimates, etc.
ENG
There are no comments for this item.