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:20250415T163000
DTEND;TZID=Asia/Seoul:20250415T173000
DTSTAMP:20260417T033752
CREATED:20250211T042237Z
LAST-MODIFIED:20250331T222415Z
UID:10569-1744734600-1744738200@dimag.ibs.re.kr
SUMMARY:Nicola Lorenz\, A Minor Characterisation of Normally Spanned Sets of Vertices
DESCRIPTION:A rooted spanning tree of a graph $G$ is called normal if the endvertices of all edges of $G$ are comparable in the tree order. It is well known that every finite connected graph has a normal spanning tree (also known as depth-first search tree). Also\, all countable graphs have normal spanning trees\, but uncountable complete graphs for example do not. In 2021\, Pitz proved the following characterisation for graphs with normal spanning trees\, which had been conjectured by Halin: A connected graph $G$ has a normal spanning tree if and only if every minor of $G$ has countable colouring number\, i.e. there is a well-order of the vertices such that every vertex is preceded by only finitely many of its neighbours. \nMore generally\, a not necessarily spanning tree in $G$ is called normal if for every path $P$ in $G$ with both endvertices in $T$ but no inner vertices in $T$\, the endvertices of $P$ are comparable in the tree order. We establish a local version of Pitz’s theorem by characterising for which sets $U$ of vertices of $G$ there is a normal tree in $G$ covering $U$. The results are joint work with Max Pitz.
URL:https://dimag.ibs.re.kr/event/2025-04-15/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR