|Title: Maximal number of cycles in a triangle-free graph|
|Speaker: Andrii Arman of The University of Manitoba, Winnipeg|
|Contact: Dwight Duffus, firstname.lastname@example.org|
|Date: 2016-03-28 at 4:00PM|
A typical problem in extremal graph theory is determining the maximal number of edges in a graph that does not contain a forbidden subgraph F. For example, such questions are partially answered by the Mantel, Turan and Erdos-Stone theorems. One way to generalize those theorems would be to determine how many copies of specific subgraphs an F-free graph can have. In my talk I will discuss our recent paper with S.Tsaturian and D.Gunderson about the number of cycles in a triangle-free graphs, possible generalizations and open questions related to this problem.
See All Seminars