Intereting Posts

The sum of an uncountable number of positive numbers
Computing the number of nonisomorphic finite abelian groups of order $n$
Probability of $\limsup$ of a sequence of sets (Borel-Cantelli lemma)
Finitely generated modules over a Noetherian ring are Noetherian
Moriarty's calculator: some bizarre and deceptive graphical anomalies
Understanding Power Series Multiplication Step
sigma algebra stochastic process
Generating sequences using the linear congruential generator
If $G = C_{25}\times C_{45}\times C_{48}\times C_{150}$, where $C_n$ denotes a cyclic group of order $n$, how many elements of order 5 does $G$ have?
Are Hausdorff compactifications of a Tychonoff space $X$ in one-to-one correspondence with completely regular subalgebras of $BC(X)$?
How to construct a line with only a short ruler
Sur- in- bijections and cardinality.
On the number of ways of writing an integer as a sum of 3 squares using triangular numbers.
Generalized “scalar product” based on multilinear form?
How many integer solutions to a linear combination, with restrictions?

What is your recommendation for an in-depth introductory combinatoric book? A book that doesn’t just tell you about the multiplication principle, but rather shows the whole logic behind the questions with full proofs. The book should be for a first-year-student in college. Do you know a good book on the subject?

Thanks.

- Unconventional mathematics books
- What are some good ways to get children excited about math?
- Seeking a layman's guide to Measure Theory
- Important applications of the Uniform Boundedness Principle
- What are the most overpowered theorems in mathematics?
- What is the best book for studying discrete mathematics?

- Examples of mathematical results discovered “late”
- Artinian - Noetherian rings and modules suggest study guide
- Properties of generalized limits aka nets
- Examples of non-obvious isomorphisms following from the first isomorphism theorem
- What are your favorite proofs using mathematical induction?
- Prerequisites/Books for A First Course in Linear Algebra
- Accidents of small $n$
- Rigour in mathematics
- Examples of non symmetric distances
- How to prove every closed interval in R is compact?

My personal favorites are the following:

- Introduction to Combinatorial analysis [Riordan]
- Concrete Mathematics [Graham, Knuth, Patashnik]
- Enumerative Combinatorics vol. $1$ [Richard Stanley]

(is not always that introductory, but for those who like counting, it is a must have)

If you want really easy, but still interesting books, you might like Brualdi’s book (though apparently, that book has many mistakes). Also interesting might be some chapters from Feller’s book on Probability (volume $1$).

If the student’s leaning towards computer science at all, I’d recommend Knuth et. al.’s Concrete Mathematics. It’s full of solid math and has the aim of building mathematical tools for CS. Other than that, a newer addition that looks promising is Russell Merris’s “Combinatorics, 2nd ed.” It gives a pretty broad introduction while also giving in-depth work and examples.

Try *Principles and Techniques in Combinatorics* by Chen Chuan Chong and Koh Khee Meng or *Combinatorics* by Peter Cameron. The latter is more advanced and has more topics.

A good suggestion is *Combinatorial Problems and Exercises* by László Lovász.

I really like “A Course in Enumeration” by Martin Aigner.

This is not precisely what you want, but you could look at “Generatingfunctionology”. The second edition is free, and can be downloaded here http://www.math.upenn.edu/~wilf/DownldGF.html

The book is about generating functions, which are helpful in combinatorial arguments.

I had my first intro graph theory and combinatorics class last semester. The book we were using was pretty terrible so I looked around and found a copy of Combinatorics and Graph Theory by Harris et. al. and I really enjoyed it. The book contains a lot of topics and the explanations are very to the point. I especially liked the sections on Ramsey numbers.

The questions are all to the point and illustrate some important concept which is also nice. For example in the section on the happy ending problem the exercises reconstruct several historical proofs and introduce you to other problems like the empty polygon problem.

Here is a very positive review I read recently: http://www.maa.org/reviews/combinatoricsgraphs.html

Edit: I’m not sure if this book is appropriate for your situation specifically, but I highly recommend it none the less.

I’m quite fond of Benjamin and Quinn’s Proofs that Really Count: The Art of Combinatorial Proof.

I’m fond of Miklós Bóna, *Introduction to Enumerative Combinatorics*; it’s extremely well written and doesn’t require a lot of background. Of the books that have already been mentioned, I like Graham, Knuth, & Patashnik, *Concrete Mathematics*, isn’t precisely a book on combinatorics, but it offers an excellent treatment of many combinatorial tools; it probably requires a little more mathematical maturity than the Bóna. A good next step beyond the relatively elementary level is Wilf, *generatingfunctionology*. Tucker, *Applied Combinatorics*, is very elementary but gives a decent taste of a very wide range of combinatorial topics.

Not already mentionned (oldie but goodie):

A course in Combinatorics by van Lint and Wilson

(book cover with card suits).

A lot of small chapters, some challenging concepts, basic graph, coding and design theory.

There are some excellent combinatorics books which also look at the applicability of combinatorics both within mathematics and outside of mathematics:

a. Applied Combinatorics by Fred Roberts

b. Applied Combinatorics by Alan Tucker

*A Path to Combinatorics for Undergraduates*, by Titu Adreescu and Zuming Feng introduces the subject by presenting a large number of problems (many from Olympiads and other competitions), and covers a broad range of methods and results.

Something that often gets ignored is Schaum’s Outlines: Combinatorics by V. K. Balakrishnan. Lots of small examples that are manageable by a beginner, shows you ‘how to do it’ in a straightforward manner.

Try also Notes on Introductory Combinatorics by Polya,Tarjan, and Woods. An earlier version is freely available online.

Applied Combinatorics by Alan Tucker is a good one. It’s short, not hard to follow, a lot of problems to work through, and it’s split into two sections: graph theory in section 1, and combinatorics (generating functions, counting techniques, etc) in section 2.

A very good introduction to the subject is Combinatorics: an introduction By Faticoni

In my opinion, Cohen’s Basic Techniques of Combinatorial Theory is a good introduction for who first learning about the subject. If you want to see many outstanding ideas, I suggest Proofs that Really Count by Benjamin/Quinn. For complete studies, Stanley’s famous 2 volumes is a good choice

Alan Tucker’s book is rather unreadable. I’d avoid it. Nick Loehr’s Bijective Combinatorics text is much more thorough, and it reads like someone is explaining mathematics to you. It mixes rigor and approachability quite well.

1.Introduction to combinatorics by alan slomson/Applied combinatorics by alan tucker.

2.Principles and techniques in combinatorics/A path to combinatorics for undergraduates.

3.Combinatorial mathematics by vilenkin.**It has problems from USSR math OLYMPIAD**

- How to solve simultaneous equations using Newton-Raphson's method?
- Bounded linear operator on a Hilbert space
- How to prove $2+2=4$ using axioms of real number system?
- Calculus of variations with two functions and inequality
- Proving $\mathrm e <3$
- Translations in two dimensions – Group theory
- Counterexample for a non-measurable function?
- Given 3 distinct primes {$p,q,r$}, then $|G|=pqr \implies G$ not simple
- Is Tolkien's Middle Earth flat?
- Given an injection $\mathbb{N}\to\mathcal{P}(X)$, how can we construct a surjection $X\to\mathbb{N}$?
- Proving that $e^{\pi}-{\pi}^e\lt 1$ without using a calculator
- Simple example of non-arithmetic ring
- A continuous surjective function from $(0,1]$ onto $$
- Prove that a ring $R$ with no non-trivial right ideals and $aR=0$ has $|R|=p$ prime
- Notation to work with vector-valued differential forms