MATH 351(a) Introduction to Graph Theory
- Faculty
- Mathematics
- Last listed
- 1974–75
No longer offered. It’s in Waterloo’s scanned calendars from 1968–69 to 1974–75; the 1995–96 to 2023–24 calendars are on ucalendar.
Basic concepts; Konigsberg bridge problem, Euler trails and Hamiltonian cycles; marriage problem, maximum matchings, Hall’s theorem; planar graphs, four colour problem, chromatic number; Ramsey’s theorem. Stress will be on problem solving. Recommended for students interested in learning the basics of graph theory and for those intending to take higher level courses in graph theory. 2 hours lectures, one term Prerequisites: No formal prerequisites. M239 recommended
As printed in the 1973–74 to 1974–75 calendars, read by OCR; the scanned page is the original.
Discussed on r/uwaterloo
3 posts and comments in 3 threads mention MATH 351, March 2016 to December 2024. Quoted word for word, newest first; each reply sits under the post and the comment that started its branch. Search r/uwaterloo for newer posts.
Fall 2017
Worst experience so far at UW? 3 points, 14 comments
“if any, of course :)”
u/PlaceUndiscovered: “… Long story short: Working on CS 245 fucked up CS 246, which in turn fucked up math 351, which fucked up math 347. Had the 351 final on Thursday and I don't think I'm gonna be passing the course. The 246 final project took up way too much time. …”
Winter 2017
Advice on taking Math 247 and Pmath 351 at the same time 1 point, 6 comments
“For pmath students I was wondering what you think about taking these two courses at the same time. For background I've taken math 137,138,237 with high grades. …”
u/theakholic357: “… Math 351 has a lot of uniform convergence and Weirstrauss M-test kinda things which afaik is not done in 138 and is not really that easy to do on your own. So it really depends on you. …”
Winter 2016
What classes do you have next semester? 5 points, 26 comments
u/Jyan: “MATH351, ECE603.”
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1968–69 to 1974–75, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1973–74 to 1974–75 2 calendars
Basic concepts; Konigsberg bridge problem, Euler trails and Hamiltonian cycles; marriage problem, maximum matchings, Hall’s theorem; planar graphs, four colour problem, chromatic number; Ramsey’s theorem. Stress will be on problem solving. Recommended for students interested in learning the basics of graph theory and for those intending to take higher level courses in graph theory. 2 hours lectures, one term Prerequisites: No formal prerequisites. M239 recommended
1968–69 to 1972–73 5 calendars
Titled Introduction to Graph Theory and Combinatorial Analysis.
Graphs, paths, arcs, circuits, connected graphs, trees, spanning trees, digraphs, Euler paths, tournaments, complete paths in tournaments, factors of bipartite graphs, Menger’s Theorem and flows in networks, theory of enumeration, generating functions, Ramsey’s Theorem and applications, systems of distinct representatives, Latin squares, balanced incomplete block designs and (v.k.) configurations. Applications to practical problems and other areas of mathematics.