I plan to discuss a characteristic of a graph, known as “domination number/dominating set”. An Olympiad problem will be discussed and also an interesting result of Alon and Spencer, given in their book “The Probabilistic Method”. 726 more words
Tags » Math Olympiads
Problem 3 (Miklós Schweitzer 2010). Let be distinct subsets of the base set complying to the following condition
for any Find the maximum value of… 148 more words
I have come across this problem many times since it appeared in public. It somehow didn’t attract me, but I knew, it was not difficult for an IMO level problem. 438 more words
Flipping through some college problems I saw this gem. The name of Paul Erdos added additional curiousity.
Problem (AMM , E3000, Paul Erdös). Let be an infinite sequence and suppose converges. 242 more words
Have you ever experienced a situation when interpreting of a problem in graph theory language makes things worse? Here is an example.
Problem C1, IMO 2005 Shortlist… 543 more words