Opening book details…
Can I read Problems in Combinatorics and Graph Theory (Wiley Series in Discrete Mathematics and Optimization) on EtoBox?
Problems in Combinatorics and Graph Theory (Wiley Series in Discrete Mathematics and Optimization) by Ioan Tomescu (author), Robert A. Melter (translator) is a nonfiction available to read on EtoBox.
What is Problems in Combinatorics and Graph Theory (Wiley Series in Discrete Mathematics and Optimization) about?
Covers the most important combinatorial structures and techniques. This is a book of problems and solutions which range in difficulty and scope from the elementary/student-oriented to open questions at the research level. Each problem is accompanied by a complete and detailed solution together with appropriate references to the mathematical literature, helping the reader not only to learn but to apply the relevant discrete methods. The text is unique in its range and variety -- some problems include straightforward manipulations while others are more complicated and require insights and a solid foundation of combinatorics and/or graph theory. Includes a dictionary of terms that makes many of the challenging problems accessible to those whose mathematical education is limited to highschool algebra.
Who reads Problems in Combinatorics and Graph Theory (Wiley Series in Discrete Mathematics and Optimization)?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Ioan Tomescu (author), Robert A. Melter (translator)
- Publisher
- Wiley-Interscience
- Published
- 1985
- Language
- EN
- ISBN
- 9780471801559
- Category
- nonfiction
- Subjects
- Mathematics, Stem
More by Ioan Tomescu (author), Robert A. Melter (translator)
Browse all works by Ioan Tomescu (author), Robert A. Melter (translator)
Similar books
- Introduction to Combinatorics (Wiley Series in Discrete Mathematics and Optimization) — Erickson, Martin J., (1996)
- Problems in Combinatorics and Set Theory — Tomescu Ioan.
- Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) — Ding-Zhu Du, Ker-I Ko (2014)
- Search Problems (Wiley Series in Discrete Mathematics and Optimization) — Rudolf Ahlswede and Ingo Wegener (1987)
- Topological Graph Theory (Wiley Series in Discrete Mathematics and Optimization) — Jonathan L. Gross, Thomas W. Tucker (1987)
- Graph Theory (Wiley-Interscience Series in Discrete Mathematics and Optimization) — Russell Merris (2000)