Navigation

List of Coauthors:

Richard C. Brewster (x 2)
Bruce A. Reed
Douglas B. West
Hehui Wu (x 2)
Xuding Zhu

"A mathematical theory is not to be considered complete until you have made it so clear that you can explain it to the first man whom you meet on the street."

--David Hilbert

"I remember one occasion when I tried to add a little seasoning to a review, but I wasn't allowed to. The paper was by Dorothy Maharam, and it was a perfectly sound contribution to abstract measure theory. The domains of the underlying measures were not sets but elements of more general Boolean algebras, and their range consisted not of positive numbers but of certain abstract equivalence classes. My proposed first sentence was: "The author discusses valueless measures in pointless spaces."

--Paul R. Halmos

"A large part of mathematics which becomes useful developed with absolutely no desire to be useful, and in a situation where nobody could possibly know in what area it would become useful; and there were no general indications that it ever would be so."

-- John von Neumann

"Chebyshev said it, and I say it again. There is always a prime between n and 2n."

--Paul Erdős

"The first sign of senility is that a man forgets his theorems, the second sign is that he forgets to zip up, the third sign is that he forgets to zip down."

--Stanislaw Ulam

Montréal Weather

Jonathan Noel

M.Sc. Student
Dept. Mathematics and Statistics
McGill University
Montréal, QC, Canada

Curriculum Vitae
Google Scholar profile

Education:

B.Sc. (Hons) Mathematics
Thompson Rivers University
April 2011
Honours Thesis: The Invariant Subspace Problem
Advisor: Robb Fry

Research Interests:

Combinatorics: graph colouring, graph homomorphisms, extremal combinatorics, probabilistic method, Ramsey theory.

My advisor is Bruce Reed.

My Master's research is on list colouring. This includes a solution of Ohba's Conjecture by myself, Bruce Reed and Hehui Wu. For information about our proof, click here.

Here is where you can find the latest draft of my thesis: Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond.

Ohba's Conjecture can be found as Unsolved Problem 50 in the book Graph Theory by Bondy and Murty.

I have an Erdős number of 3 (soon to be 2).

Publications:

1. A Proof of a Conjecture of Ohba (with Bruce A. Reed and Hehui Wu). Submitted. Also available on arXiv.

2. A Bound on the Choice Number of a Graph in terms of its Order and Chromatic Number (with Douglas B. West, Hehui Wu and Xuding Zhu). In preparation.

3. Mixing Homomorphisms and Extending Circular Colourings (with Richard C. Brewster). Submitted.

4. Extending precolourings of circular cliques (with Richard C. Brewster). Discrete Math. 312 (1) (2012) 35--41.

Interests:

Running, music, documentary films.