*The Art of Combinatorics*, which is a series of four advanced graduate textbooks/reference books, on "Extremal Graph Theory", "Structure of Graphs", "Order and Optimization", and "Arrangements and Methods"; each is intended to be (I think) a semester or so worth of material. The series is in preparation; the title is, of course, a nod to Knuth. I can't vouch for the books being any good, because I haven't seen them.

There seem to be a lot of lists of open problems scattered about the Internet. Has anyone compiled a list of lists of open problems?

(I found the glossary while Googling for information about hook length of partitions; it didn't help for that, because I already know what hook length

*is*.)

## 2 comments:

I don't know of any 'list-of-list', but I know of the "Open Problem Garden", http://garden.irmacs.sfu.ca/

which is an online list/wiki of open problems. Quite interesting.

On which list would we put the open problem of compiling a list of lists of open problems?

Post a Comment