Review assignment

Assignment: Review of a research paper

To successfully complete this mandatory assignment, you are supposed to write a review of a research paper. Each group should hand in a review report of the paper they have been assigned. The report must not be written by hand. Groups with the same paper can discuss the paper with each other, but the report must be written independently by each group. I have sent an email to all of you on November 5, which group you belong to.

I don't want to specify exactly how long the review should be, but 500 words are probably too few and 3000 are certainly too many.

The intended reader has your background in mathematics but has not read the article. Important things that (s)he wants to know are:

What is the motivation for the article to exist? In what context does the article fit?
What are the main results? Why are they important? (Or, why are they not important?)
How do the proofs go? Main ideas and techniques? Sketch important proofs but leave out tedious details that you find less significant.
Your (motivated) opinion on the article? Well-presented or not? Important or not? Interesting or not? What is good? What is bad?

As long as it is not too terrible, I will not grade your style of writing, but the review should be readable as a text. Write proper sentences and be nice to the reader.

The deadline for the written report is beginning of class November 28, 2017. In that class each one of you will be asked to present the paper you have read to a group of other students (sitting down around a table) that each have read a different paper. You will have roughly 20 minutes for your presentation.

During the presentation of other students: be active, ask questions, make sure you understand.
----

The papers:

Carl Johan Casselgren, Coloring Graphs From Random Lists of Fixed Size, Random Structures and Algorithms, vol 44 (2014), no. 3, 317–327.
H. R. Hind, An upper bound for the total chromatic number , Graphs and Combinatorics, vol 6 (1990) 153-159.
Hecht and Ullman, Characterization of Reducible Flow Graphs, Journal of the Association for Computing Machinery, Vol 21, No 3, (1974), 367-375.
Marthe Bonamy and Nicolas Bousquet, Brooks' theorem on powers of graphs.
Discrete Math. vol 325 (2014), 12–16.