BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ooo ZNANOST! - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:ooo ZNANOST!
X-ORIGINAL-URL:https://ern.um.si/?lang=en
X-WR-CALDESC:Events for ooo ZNANOST!
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20260101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20260218T160000
DTEND;TZID=UTC:20260218T170000
DTSTAMP:20260509T061453
CREATED:20250507T142345Z
LAST-MODIFIED:20260507T143240Z
UID:10000790-1771430400-1771434000@ern.um.si
SUMMARY:Excursions into the Mathematical Universe: Matchings in Graphs\, from Stable Marriages to Blooming
DESCRIPTION:A series of popular science lectures titled “Excursions into the Mathematical Universe.” The lectures are primarily intended for students of secondary schools in the Primorska region\, but they are also open to the general public. Researchers and university lecturers will present ancient and modern mathematical concepts and their applicability in various fields of science\, natural sciences\, and social sciences in an accessible way. \n\nMatchings in Graphs\, from Stable Marriages to Blooming \nSuppose we have six gifts that we would like to distribute among five friends. Can we give one gift to each friend in such a way that everyone receives something they will be happy with? This is an example of a problem where matchings can help us if we model it using graphs. In this lecture\, we will look at what a graph is\, what a matching in a graph is\, how we can efficiently find one (if it exists at all)\, and some other problems that can be solved using matchings. \nAbout the lecturer: Nina Chiarelli graduated in 2011 from the Faculty of Education in Koper in the field of mathematics and computer science and earned her PhD in mathematical sciences in 2016 at UP FAMNIT. She has been employed at UP FAMNIT since 2014\, first as an assistant and later as an assistant professor. Since 2017\, she has also been employed as a researcher at UP IAM. Her research focuses on discrete mathematics\, with an emphasis on graph theory. \n\n\nFurther below\, you are kindly invited to read and view the following materials related to the event: \n\nThe invitation with the program is available at this link.\nEvent materials are available at this link.\nA recording of the event is available at this link.\nPhotos from the event:
URL:https://ern.um.si/dogodek/excursions-into-the-mathematical-universe-matchings-in-graphs-from-stable-marriages-to-blooming/?lang=en
LOCATION:Koper\, Univerza na Primorskem\, Fakulteta za matematiko\, naravoslovje in informacijske tehnologije\, Glagoljaška ulica 8\, Koper\, 6000\, Slovenija
CATEGORIES:Mathematics
ATTACH;FMTTYPE=image/png:https://ern.um.si/wp-content/uploads/2024/08/UP-FAMNIT-004.png
END:VEVENT
END:VCALENDAR