Ramsey-Turán Results
Document Type
Presentation Abstract
Presentation Date
4-1-2024
Abstract
The celebrated Turán's Theorem sits at the heart of extremal combinatorics, yielding the maximum number of edges in a graph free of cliques of some proscribed size. Graphs achieving this maximum are highly structured, with large sets of vertices free from edges. The Ramsey-Turán problem reformulates this problem by asking for the maximum to the Turán problem of a less structured graph. We explore the history and more recent results in this area.
Recommended Citation
Magnan, Van, "Ramsey-Turán Results" (2024). Colloquia of the Department of Mathematical Sciences. 675.
https://scholarworks.umt.edu/mathcolloquia/675
COinS
Additional Details
Link to the presenter's dissertation.
April 1, 2024 at 3:00 p.m. Math 103