Abstract:
The Tur\'an Number, ex(n,H)=mex(n,H)=m, for the graph HH is the maximum number of edges such that there exists a graph GG with nn vertices and mm edges that does not contain a subgraph isomorphic to HH. In this presentation we will explore the methods used for finding these numbers for complete graphs KrKr as well as for specific bipartite graphs.
Speaker
Duncan Crowley
Research Area
Pure Maths Seminar
Affiliation
University of New South Wales
Date
Mon, 17/10/2016 - 11:00am to 12:00pm
Venue
RC-4082, The Red Centre, UNSW