BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e3fbbf303b6
DTSTART;TZID=America/Toronto:20221121T180000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221121T180000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-daniel-horsley
SUMMARY:Algebraic Graph Theory - Daniel Horsley
CLASS:PUBLIC
DESCRIPTION:TITLE: Exact Zarankiewicz numbers through linear hypergraphs\n
 \nSpeaker:\n Daniel Horsley \n\nAffiliation:\n Monash University\n\nLocati
 on:\n Contact Sabrina Lato for Zoom link\n\nABSTRACT: The \\emph{Zarankie
 wicz number} $Z_{2\,2}(m\,n)$ is usually\ndefined as the maximum number of
  edges in a bipartite graph with parts\nof sizes $m$ and $n$ that has no $
 K_{2\,2}$ subgraph. An equivalent\ndefinition is that $Z_{2\,2}(m\,n)$ is 
 the greatest total degree of a\nlinear hypergraph with $m$ vertices and $n
 $ edges. A hypergraph is\n\\emph{linear} if each pair of vertices appear t
 ogether in at most one\nedge. The equivalence of the two definitions can b
 e seen by\nconsidering the bipartite incidence graph of the linear hypergr
 aph.
DTSTAMP:20260418T214639Z
END:VEVENT
END:VCALENDAR