Kvant selecta: Combinatorics. I. Collection of articles translated by Hal McFaden from Russian editions of the journal Kvant (Q2765140)

This is the third AMS collection of articles that originally appeared in the well known Russian magazine Kvant. This collection consists of papers on combinatorial and discrete mathematics, written by some of Russia's best mathematicians and expositors. The book is, as the original Kvant was, published for gifted secondary students but was a major source of entertainment and instructional innovation for professional mathematicians and teachers. An enjoyable reading to be sure!NEWLINENEWLINENEWLINEThe subject matter would be best derived from the book's table of contents:NEWLINENEWLINENEWLINE\textit{I. M. Yaglom}, Two games with matchsticks; \textit{A. B. Katok}, Economics and linear inequalities; \textit{A. B. Katok}, Economics and linear inequalities (Continuation) \textit{R. V. Freivald}, Switching networks; \textit{G. M. Adel'son-Vel'skii, I. N. Bernshtein}, and \textit{M. L. Gerver}, Who will go to Rio?; \textit{A. L. Toom}, From the life of units; \textit{G. A. Gurevich}, Nonrepeating sequences; \textit{A. M. Stepin} and \textit{A. T. Tagi-Zade}, Words with restrictions; \textit{S. Ovchinnikov}, Planar switching circuits; \textit{P. Bleher} and \textit{M. Kel'bert}, Classification algorithms; \textit{G. Shestopal}, How to detect a counterfeit coin; \textit{M. Mamikon}, The generalized problem of counterfeit coins; \textit{P. Bleher}, Truthtellers, liars, and deceivers; \textit{V. A. Uspenskii} and \textit{A. L. Semenov}, Solvable and unsolvable algorithmic problems; \textit{P. A. Pevzner}, Best bet for simpletons.