skip to main content
Caltech

Undergraduate Math Club Seminar

Friday, October 28, 2016
12:00pm to 1:00pm
Add to Cal
Welzl's Theorem on Graph Homomorphisms
Jalex Stark, Mathematics Department, California Institute of Technology,

The rational numbers with their usual order are dense. Welzl's theorem says that the class of finite graphs, with a suitably natural order, are also dense! We'll give some category-theoretic background to motivate this result, and then we'll give the proof in full detail. The proof of the main theorem will be accessible to those with limited background.

For more information, please contact Mathematics Department by phone at 4335 or by email at [email protected].