Graph Theory and Combinatorics Seminar
- Event Type
- Seminar/Symposium
- Sponsor
- Department of Mathematics
- Location
- Altgeld Hall 147
- Date
- Dec 9, 2025 1:00 - 2:00 pm
- Speaker
- Dadong Peng
- Contact
- Abhishek Dhawan
- adhawan2@illinois.edu
- Originating Calendar
- Combinatorics Research Area Calendar
Speaker: Dadong Peng (UIUC)
Title. Turan number of vertex-disjoint cliques
Abstract. Given a graph H, the Turan number ex(n,H) of H is the maximum number of edges of an n-vertex simple graph containing no H as a subgraph. Let kK_p denote the disjoint union of k copies of the complete graph K_p. In our work, utilizing the idea of the proof of the Hajnal–Szemeredi Theorem and discharging, we determine the value ex(n,4K_p)$ for all n and p >= 3.