Combinatorics and Probability Seminar
Emily Cairncross
UIC
The feasible region of colored, ordered, and hyper- graphs
Abstract: Given a fixed proportion of edges included in a graph G on n vertices, what is the maximum and minimum number of induced copies of a fixed, small graph H that G can contain as we take n to infinity? First, we introduce the general theory of inducibility for graphs, including various results and open questions of Liu, Mubayi, and Reiher '23. We will then generalize this theory to various other types of graphs, in particular to colored graphs where we answer this question exactly for a particular 3-colored K_4.
Monday March 6, 2023 at 3:00 PM in 612 SEO