Bezoek de website voor leraren en scholieren →

ICTS-NETWORKS workshop: A Confluence of Ideas

In the vibrant city of Bangalore, India, the International Centre for Theoretical Sciences (ICTS) played host to a discussion meeting titled "Challenges in Networks" from January 29 to February 2, 2024.

Does no small structure mean larger homogeneous ones?

A conjecture of Erdős and Hajnal from 1989 says that forbidding any specific substructure results in existence of a very large homogeneous one! In this article you will have a look into one of the most fascinating problems in modern graph theory.

From building a family tree to discovering the suspect of a crime

Between 1973 and 1986 multiple rapes and murders were committed in the state of California. Years later the idea was raised that these crimes might be connected. But traditional DNA analysis from the samples found at the crime scenes, could not identify the culprit.

Trust and other wonderful mistakes humans make

Trust is required when we buy a used car from a personal connection or via-via. When we vote for a politician we trust that they will act in our favour. In this article we will explore how Game Theory is used in attempts to model trust and cooperation.

How social networks help job seekers and hirers alike

Lots of research has gone into the nexus of social networks in the labour market. Our question is: Do students benefit from the connectedness of their advisers in terms of first academic employment after graduate school?

How do I teach?

Last week I had the honour to receive an award from the Amsterdam Young Academy (AYA) for my contributions in teaching in the BSc in mathematics at the University of Amsterdam. I thought of many things during this time, and I wanted to write some thoughts down.

Picking up 13 different cards from 13 piles (Part 2)

In Part 1 Jackie explained to her fried Sam how the problem of picking a card from each of the 13 piles so that there is exactly one card with each rank translates to a problem on bipartite graphs. The mathematical problem asks you to find a perfect matching in a regular bipartite graph.

Picking up 13 different cards from 13 piles (Part 1)

Did you know that if you divide a pack of cards into 13 piles of 4 cards, then you can always pick one card from each of the 13 piles so that there is exactly one card with each rank? There is some beautiful math behind this puzzle.