BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250909T163000
DTEND;TZID=Asia/Seoul:20250909T173000
DTSTAMP:20260416T143936
CREATED:20250812T235708Z
LAST-MODIFIED:20250827T143840Z
UID:11356-1757435400-1757439000@dimag.ibs.re.kr
SUMMARY:Katherine Perry\, Symmetry breaking in trees
DESCRIPTION:We will discuss two symmetry breaking parameters: distinguishing number and fixing number. Despite being introduced independently\, they share meaningful connections. In particular\, we show that if a tree is 2-distinguishable with order at least 3\, it suffices to fix at most 4/11 of the vertices and if a tree is $d$-distinguishable\, $d \geq 3$\, it suffices to fix at most $\frac{d-1}{d+1}$ of the vertices. We also characterize the $d$-distinguishable trees with radius $r$\, for any $d \geq 2$ and $r \geq 1$. \nThis is joint work with Calum Buchanan\, Peter Dankleman\, Isabel Harris\, Paul Horn\, and Emily Rivett-Carnac.
URL:https://dimag.ibs.re.kr/event/2025-09-09/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR