Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?
I want the old design back!!! :-)

Problem A. 481. (April 2009)

A. 481. Prove that there are infinitely many n, for which there exist simple graphs S1,...,Sn with the following properties:

(a) each Si is a complete bipartite graph;

(b) the union of the graphs S1,...,Sn is a complete graph on 2n vertices;

(c) each edge of this complete graph is contained in an odd number of the graphs Si.

(5 pont)

Deadline expired on May 15, 2009.


Statistics:

3 students sent a solution.
5 points:Nagy 235 János, Tomon István.
0 point:1 student.

Problems in Mathematics of KöMaL, April 2009