# Tagged Questions

**23**

votes

**18**answers

6k views

### Interesting and Accessible Topics in Graph Theory

This summer, I will be teaching an introductory course in graph theory to talented high school seniors. The intent of the course is not to establish proficiency in graph theory, per se. Rather, I hope ...

**9**

votes

**4**answers

2k views

### A learning roadmap for Additive combinatorics.

Hello,
I'd love to learn more about the field of additive combinatorics. From what I've understand, there's a book by Tao and Vu out on the subject, and it looks fun, but I think I lack the ...

**41**

votes

**7**answers

6k views

### What is Lagrange Inversion good for?

I am planning an introductory combinatorics course (mixed grad-undergrad) and am trying to decide whether it is worth budgeting a day for Lagrange inversion. The reason I hesitate is that I know of ...

**11**

votes

**2**answers

2k views

### The probabilistic method - reference to less challenging questions

I am teaching a course in combinatorics and large part of it is dedicated to the probabilistic method especially in the case of graphs. The course is an undergraduate level (almost none of the ...

**14**

votes

**19**answers

11k views

### Good combinatorics textbooks for teaching undergraduates?

Hello, can anyone recommend good combinatorics textbooks for undergraduates? I will be teaching a 10-week course on the subject at Stanford, and I assume that the students will be strong and motivated ...

**33**

votes

**15**answers

6k views

### Strong induction without a base case

Strong induction proves a sequence of statements $P(0)$, $P(1)$, $\ldots$ by proving the implication
"If $P(m)$ is true for all nonnegative integers $m$ less than $n$, then $P(n)$ is true."
for ...