Subj. All questions about this problem please send to Jivko
Ganev.

Also we have problems with email server. So acm@timus.ru
and mb@timus.ru are temporary unavailable.

I made this problem so I can see if there are any easier
approaches to matching in general graphs than graphs
shrinking and exploding. Petko Minkov showed very nice
randomized algorithm that is not conceptualy correct but
works 100% of the times. If anyone has nice solution that
doesn't break down from odd cycles please email me at :
skyphos@softhome.net .