English Információ A lap Pontverseny Cikkek Hírek Fórum

Rendelje meg a KöMaL-t!

Kifordítható

tetraéder

VersenyVizsga portál

Kísérletek.hu

Matematika oktatási portál

B. 4762. In a simple graph, the degree of each vertex is four, and for each edge there exists exactly one vertex connected to both ends of the edge. What is the minimum number of vertices in such a graph?

(3 points)

Deadline expired on 10 February 2016.

Statistics on problem B. 4762.
 123 students sent a solution. 3 points: 86 students. 2 points: 11 students. 1 point: 5 students. 0 point: 21 students.

• Problems in Mathematics of KöMaL, January 2016

•  Támogatóink: Morgan Stanley