BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20260114T153000
DTEND;TZID=UTC:20260114T163000
DTSTAMP:20260613T134640
CREATED:20260109T110348Z
LAST-MODIFIED:20260109T110348Z
UID:8481-1768404600-1768408200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Colourings of Balanced Incomplete Block Designs That Are Almost Locally Equitable \nDate and Time: Wednesday\, January 14\, 3.40 pm Atlantic time\nSpeaker: William Kellough\, Memorial University of Newfoundland \nAbstract: In this talk\, we study $\ell$-colourings of $(v\,k\,\lambda)$-BIBDs where within each block\, one colour is absent and the rest appear exactly $\frac{k}{\ell-1}$ times. We give necessary conditions for such colourings to exist. We show how Hadamard matrices\, affine planes\, and twin prime powers can be used to construct such coloured BIBDs. \nZoom link:\nhttps://us02web.zoom.us/j/88013261876?pwd=XGocyHqvseXY8metPztPoSuulEEejX.1 \nMeeting ID: 880 1326 1876\nPasscode: 357963
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-35/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20260121T153000
DTEND;TZID=UTC:20260121T163000
DTSTAMP:20260613T134640
CREATED:20260119T195230Z
LAST-MODIFIED:20260119T195230Z
UID:8488-1769009400-1769013000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Shahriyar Pourakbar Saffar\, Memorial University of Newfoundland\nTitle: Existence of uniquely 2-colourable 4-cycle decompositions: A constructive proof\n\nAbstract: A cycle system of order $n$ is a decomposition of the edges of the complete graph $K_n$ into cycles of a fixed length. A cycle system is said to be $k$-colourable if we can assign $k$ colours to its vertices so that no cycle is monochromatic. If a cycle system is $k$-colourable but not $(k-1)$-colourable\, it is called $k$-chromatic. A $k$-colourable cycle system is uniquely $k$-colourable if its colouring is unique up to the permutation of colour classes.\n\nThe study of colouring cycle systems has been explored in various settings. In particular\, Horsley and Pike have examined the existence of $k$-chromatic $m$-cycle systems for any integers $m>2$ and $k>1$. While Forbes has investigated $3$-cycle systems with unique $3$-colourability\, the existence of uniquely $k$-colourable $m$-cycle systems in general remains an open problem.\n\nIn this talk\, we mainly focus on the construction of an infinite family of uniquely $2$-colourable $4$-cycle systems and also a uniquely $2$-colourable $4$-cycle decomposition of $K_n – I$\, for infinitely many integers $n \geq 2$. These constructions contribute to the broader study of uniquely colourable cycle systems and open new directions for future research.\n\n\nZoom link:\nhttps://us02web.zoom.us/j/88013261876?pwd=XGocyHqvseXY8metPztPoSuulEEejX.1\n\nMeeting ID: 880 1326 1876\nPasscode: 357963
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-36/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR