BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//New College of Florida - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:New College of Florida
X-ORIGINAL-URL:https://www.ncf.edu
X-WR-CALDESC:Events for New College of Florida
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250121T150000
DTEND;TZID=America/New_York:20250121T160000
DTSTAMP:20260504T092529
CREATED:20250118T033012Z
LAST-MODIFIED:20250118T033012Z
UID:30293-1737471600-1737475200@www.ncf.edu
SUMMARY:Mathematics Tenure-Track Candidate Talk
DESCRIPTION:Please join us for the talk by our first tenure-track candidate in Mathematics. Anastasia Halfpap will speak on Tuesday\, January 21\, at 3:00 PM in HNS 106. We hope to see you there. \nNecmettin Yildirim and Eirini Poimenidou \nCo-chairs of the search committee \n  \nHere is the title and abstract: \nTitle: Rainbow Turán and Saturation Numbers: Colorful Problems in Extremal Graph Theory \nAbstract: A graph is a discrete mathematical structure consisting of two sets: a vertex set V of base elements\, and an edge set E which describes the connections between elements. Graphs can naturally be visualized as a set of points (vertices) in the plane connected by lines (edges). Study of graphs is motivated by many applications both within and outside mathematics\, as well as the deep and beautiful pure-mathematical theory describing their properties. In this talk\, we will introduce the field of extremal graph theory\, which asks how large (or small) some graph parameter can be given some structural restrictions upon the graph. For example\, in a graph containing n vertices and with the property that no three vertices are connected to form a triangle\, how many total edges are possible? As well as introducing some history of extremal problems\, we will discuss some recent work in the area of rainbow extremal problems\, which asks extremal-type questions in an edge-colored graph setting.
URL:https://www.ncf.edu/event/mathematics-tenure-track-candidate-talk/
CATEGORIES:Public Notices
END:VEVENT
END:VCALENDAR