product iamge

Problems in combinatorics and graph theory

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Ioan Tomescu (author), Robert A. Melter (translator)
Series: Wiley-Interscience series in discrete mathematics
Publisher: Wiley
Year: 1985

Language: English
Commentary: new scan of the same book as http://libgen.rs/book/index.php?md5=1FA5A6BEE5CD359EF520ACB2F11481A9
Pages: 335
City: New York

Title
Preface
Contents
Glossary of Terms Used
Part I: Statements of Problems
1. Combinatorial Identities
2. The Principle of Inclusion and Exclusion; Inversion Formulas
3. Stirling, Bell, Fibonacci, and Catalan Numbers
4. Problems in Combinatorial Set Theory
5. Partitions of Integers
6. Trees
7. Parity
8. Connectedness
9. Extremal Problems for Graphs and Networks
10. Coloring Problems
11. Hamiltonian Problems
12. Permutations
13. The Number of Classes of Configurations Relative to a Group of Permutations
14. Problems of Ramsey Type
Part II: Solutions
Chapter 1
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 12
Chapter 13
Chapter 14
Bibliography