So I stressed myself out a little too much preparing for the combinatorics exam. Mostly because well I didn’t really feel like I had a grasp on what was going to be on the exam. In the end I had completed the two hour exam in about 45 min and I am pretty sure I got a perfect score or close to it.
The format of the exam was kind of strange there were 5 problems worth 40 points of which we had to chose 2 and 5 problems worth 30 points of which we had to chose 4. I can’t remember what all the first 5 problems were. There was one to prove the binomial theorem which I almost did, one dealing with one-to-one correspondences, something strange that I can’t seem to recall, and then the two that I did.
The first one I did was to show that the Ramsey number R(3,3)=6. I was honestly surprised that this was on there. I knew there was going to be a problem dealing with Ramsey numbers, but I expected something more difficult. Truthfully I expected that a problem to show that R(3,3,3)=17.
Like I said I was going to do the prove the binomial theorem problem, but I read the 5th problem and it seemed like it would be easier to do without making a mistake so I went with it. Problem 5 defined relation to be transitive and reflexive and another relation (Q, ~) such that R~T iff
and
and we were asked to show that (Q, ~) was an equivalence relation. Like I said this test seemed really easy.
The other 5 problems I was just going to do the first 4, but one had some sum of binomial coefficients and asked for a binomial coefficient that it was equal to and I thought I might mess up the algebra on that one so I skipped it. The 4 problems I did were a direct application of the pigeon-hole principle, a direct application of the binomial theorem, a counting problem related to poker hands, and provide the definition of reflexive, symmetric, antisymmetric, transitive, partial order, and equivalence relation.
The exam was yesterday afternoon so I didn’t expect them to graded by this morning and they weren’t, but we did discuss what we were going to do for the next four weeks. He wasn’t sure if we wanted to continue on the counting stuff or work on some of the other areas of combinatorics. We finally settled on one week on inclusion/exclusion, one week on designs, and two weeks on graph theory.
I’m glad we are going to get some graph theory since that is mainly the reason I took the class and well the professor is a graph theorist so it should be interesting. I’m not quite sure exactly what is meant by designs, but apparently that is the primary area of interest of Brualdi who authored the text so I guess it makes sense to spend some time there. It should be an interesting four weeks in combinatorics.