Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Visit our COVID-19 information website to learn how Warriors protect Warriors.
Please note: The University of Waterloo is closed for all events until further notice.
Title: On the Hardness of 4-coloring a 3-colorable graph
Speaker: Akshay Ramachandran Affiliation: University of Waterloo Room: MC 5479Abstract: A consequence of the PCP theorem is that it is NP-hard to approximate the chromatic number of a general graph to within \n^{1-\eps} for any constant epsilon.
Title: From graph theory to set theory and back
Speaker: Anton Bernshteyn Affiliation: Carnegie Mellon University Room: MC 5501Abstract:
Many results in finite combinatorics can be extended to infinite structures via compactness---but this transfer is powered by the Axiom of Choice and leads, in general, to highly "pathological" objects.
Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land promised to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Indigenous Initiatives Office.