/***
##############################
# Identification of the news #
##############################
# DO NOT MODIFY
name: penny-haxell-visit
date: 2019-04-05


################
# General data #
################

# the picture address, in dokuwiki or web syntax
picture = :actualites:ressources:perso-penelope-haxel.jpg

# the name displayed when hovering over the picture (optional)
picture tag = Penny Haxell

# the link to be followed when clicking on the picture (optional)
picture link = 

# the link in the circled arrow icon (optional)
extra link = https://uwaterloo.ca/combinatorics-and-optimization/people-profiles/penny-haxell


#######################
# Visibility/priority #
#######################
#
# This part describes when the news should be visible, and with what priority (how high in the list).
#

from 2019-03-28 for 5 weeks, priority= low
from 2019-03-28 for 4 weeks, priority= normal
from 2019-03-28 for 2 week, priority= high

#
# Other intervals of priority can/have to be specified.
#
# As a rule of thumb:
#  - priority high for up to 3 days, 10 days for very important events (FOCS) (appears top of the list)
#  - priority normal for up to 2 or 3 weeks (appears with high probability)
#  - priority low for as long as one wishes (probably invisible but sometimes can be if there is sufficient space)
#  - priority null makes the news invisible
#  - priorities may change several times (e.g. high for registration and for the event)
#  - this syntax can also be used for changing pictures, links, ...
#
# The syntax is the following
#   from DATE until DATE, priority= PRIORITY
#   from DATE for DURATION, priority= PRIORITY
#   for DURATION until DATE, priority= PRIORITY
#
# PRIORITY: high | normal | low | null
#
# DATE:
#   NUMBER MONTH NUMBER   (e.g. 22 June 2018)
#   ???-??-??             (e.g. 2018-06-22)
#
# DURATION:
#   NUMBER (day|days|week|weeks|month|months|year|years)


##########
# Notion #
##########
# if one wants to have a notion (a small text that unravels when clicked and is used to highlight a concept)
#
notion = Extremal combinatorics
notion text = {Extremal combinatorics studies how large or how small a collection of finite objects can be, if it has to satisfy certain restrictions. For instance, in an n-element set, what is the largest number of subsets of which none contains any other? The question is answered by Sperner's theorem, which gave rise to much of extremal set theory. Another kind of example: How many people can we invite to a party where among each three people there are two who know each other and two who don't know each other? Ramsey theory shows that at most five persons can attend such a party.}


####################
# TEXT OF THE NEWS #
####################
***/
[[https://uwaterloo.ca/combinatorics-and-optimization/people-profiles/penny-haxell|Penny Haxell]] from University of Waterloo (Canada), a world wide
expert in extremal combinatorics and graph theory, is visiting
IRIF March 28th to May 2nd.