Graph Theory Problems

1. Show that a graph with n vertices in which the degree of each

vertex is not less than n−1
2 is connected.
1. Show that a graph with n vertices in which the degree of each
vertex is not less than n−1
2 is connected.
2. Prove that
a) From a connected graph we can delete some edges to get a
tree.
b) A tree with n vertices has exactly n − 1 edges.
c) A tree has at least two vertices with degree one.
d) A connected graph of n vertices has at least n − 1 edges.
e) If a connected graph has n vertices and n − 1 edges, then it
is a tree.
3. There are 50 cities. What is the least number of flight routes
operated so that we can travel between any two cities by
using at most 2 routes.
3. There are 50 cities. What is the least number of flight routes
operated so that we can travel between any two cities by
using at most 2 routes.
4. A rectangular table has its squares painted in 23 colors. A pair
of colors is good if there are two adjacent squares, painted in
these colors. What is the minimum number of good pairs?
3. There are 50 cities. What is the least number of flight routes
operated so that we can travel between any two cities by
using at most 2 routes.
4. A rectangular table has its squares painted in 23 colors. A pair
of colors is good if there are two adjacent squares, painted in
these colors. What is the minimum number of good pairs?
5. In a country from every city there are 100 roads and from any
city we can get to any other. One road was closed for repairs.
Prove that and now from any city we can still get to any other.
6. Show that in a connected graph we can delete a vertex and all
the edges adjacent to it so that the remaining graph is still
connected.
6. Show that in a connected graph we can delete a vertex and all
the edges adjacent to it so that the remaining graph is still
connected.
7. There are n cities. Between any two cities there is a flight
operated by one of the two airline company. Prove that we
can choose one airline company so that by using flights of this
company we can travel between any city.
6. Show that in a connected graph we can delete a vertex and all
the edges adjacent to it so that the remaining graph is still
connected.
7. There are n cities. Between any two cities there is a flight
operated by one of the two airline company. Prove that we
can choose one airline company so that by using flights of this
company we can travel between any city.
8. Show that in a graph such that degree of every vertex is bigger
than 2, there exists a cycle with length not divisible by 3.
9. 20 football teams take part in a tournament. On the first day
all the teams play one match. On the second day all the
teams play a further match. Prove that after the second day
it is possible to select 10 teams, so that no two of them have
yet played each other.
 9. 20 football teams take part in a tournament. On the first day
all the teams play one match. On the second day all the
teams play a further match. Prove that after the second day
it is possible to select 10 teams, so that no two of them have
yet played each other.
10. The 20 members of a local tennis club have scheduled exactly
14 two-person games among themselves, with each member
playing in at least one game. Prove that within this schedule
there must be a set of 6 games with 12 distinct players.
 9. 20 football teams take part in a tournament. On the first day
all the teams play one match. On the second day all the
teams play a further match. Prove that after the second day
it is possible to select 10 teams, so that no two of them have
yet played each other.
10. The 20 members of a local tennis club have scheduled exactly
14 two-person games among themselves, with each member
playing in at least one game. Prove that within this schedule
there must be a set of 6 games with 12 distinct players.
11. A company has 2n + 1 persons and for any n persons, there is
a person who is friend with all of them. Prove that this
company has a person who is friend to all the other persons.
12. In a party there are 100 people. Then those who do not have
friends among the people, are gone. Then those who have
exactly one friend among the remaining, is also gone. Then
similarly those who have exactly 2, 3, 4, ..., 99 among the
remaining leave. What is the greatest number of people could
have been left at the end?
12. In a party there are 100 people. Then those who do not have
friends among the people, are gone. Then those who have
exactly one friend among the remaining, is also gone. Then
similarly those who have exactly 2, 3, 4, ..., 99 among the
remaining leave. What is the greatest number of people could
have been left at the end?
13. A person has 28 classmates and each of his classmate has a
different number of friends in the class. How many friends
does he have?
12. In a party there are 100 people. Then those who do not have
friends among the people, are gone. Then those who have
exactly one friend among the remaining, is also gone. Then
similarly those who have exactly 2, 3, 4, ..., 99 among the
remaining leave. What is the greatest number of people could
have been left at the end?
13. A person has 28 classmates and each of his classmate has a
different number of friends in the class. How many friends
does he have?
14. In a round-robin tennis tournament all players win at least one
match. Show that there are 3 players A, B, C such that A
wins B, B wins C and C wins A.
15. The country has n cities. Between any two of them there is
either a bus route or a railway. A tourist wants to go around
the country, visiting each city exactly once and returning to
the city from which he starts. Prove that the tourist can
choose a city from which he starts the journey and the mode
of transportation, so that he would have to change the mode
of transport not more than once.
15. The country has n cities. Between any two of them there is
either a bus route or a railway. A tourist wants to go around
the country, visiting each city exactly once and returning to
the city from which he starts. Prove that the tourist can
choose a city from which he starts the journey and the mode
of transportation, so that he would have to change the mode
of transport not more than once.
16. At the meeting there are n persons (n > 1). It turns out that
any two of them have exactly two common friends .
a) Prove that each of them has the same number of friends at
the meeting.
b) Give an example to show that n may be greater than four.
17. A country has more than 101 cities. The capital is connected
by airlines with 100 cities, and every city except the capital, is
connected by airlines with exactly ten cities (if A is connected
to B , then B is connected to A ). It is known that from each
city you can get to any other (perhaps with changes). Prove
that it is possible to close half of airlines coming from the
capital, so that we can still fly from any city to any other.
17. A country has more than 101 cities. The capital is connected
by airlines with 100 cities, and every city except the capital, is
connected by airlines with exactly ten cities (if A is connected
to B , then B is connected to A ). It is known that from each
city you can get to any other (perhaps with changes). Prove
that it is possible to close half of airlines coming from the
capital, so that we can still fly from any city to any other.
18. Each of the 450 members of Parliament has slapped exactly
one of his colleagues. Prove that it is possible to elect a
Parliamentary committee of 150 persons so that, among the
members of the committee, no one has slapped others.
19. Alice and Bob go on a trip to 2015 islands, where some
islands are linked by two-way boat route. They travel by
playing a game. Alice first selects the island on which they
start the trip. Then they travel together on a boat, in turn
choosing the island which was not visited before (Bob chooses
the first island to go). Who is not be able to choose an island
is lost. Prove that Alice can win the game.
19. Alice and Bob go on a trip to 2015 islands, where some
islands are linked by two-way boat route. They travel by
playing a game. Alice first selects the island on which they
start the trip. Then they travel together on a boat, in turn
choosing the island which was not visited before (Bob chooses
the first island to go). Who is not be able to choose an island
is lost. Prove that Alice can win the game.
20. There are several cities, some cities are connected by two-way
flights of n airlines. From every city there is exactly one flight
of every airline. It is known that from any city we can fly to
any other (possibly with changes). Because of the financial
crisis (n − 1) flight routes are closed, but none of the airlines
have to shut down more than one flight route. Prove that we
can still fly from any city to any other.
21. In a group of several people, some are acquainted with each
other and some are not. Every evening, one person invites all
of his acquaintances to a party and introduces them to each
other. Suppose that after each person has arranged at least
one party, some two people are still unacquainted. Prove that
they will not be introduced at the next party.
21. In a group of several people, some are acquainted with each
other and some are not. Every evening, one person invites all
of his acquaintances to a party and introduces them to each
other. Suppose that after each person has arranged at least
one party, some two people are still unacquainted. Prove that
they will not be introduced at the next party.
22. A country has 100 cities, some of which are connected by the
airlines. It is known that from any city we can fly to any other
(possibly with changes).
i) Prove that we can visit every city using at most 198 flights.
ii) Prove that we can visit every city using at most 196 flights.
23. There are 1001 the city in the country and every two cities are
connected by a one-way road. From each city there are exactly
500 roads going out and 500 roads going in. An independent
republic, which consists of 668 cities, is separated from the
country. Prove that from each city of this republic we can get
to any other city of it, without leaving the republic.
23. There are 1001 the city in the country and every two cities are
connected by a one-way road. From each city there are exactly
500 roads going out and 500 roads going in. An independent
republic, which consists of 668 cities, is separated from the
country. Prove that from each city of this republic we can get
to any other city of it, without leaving the republic.
24. In a country, some cities are connected by roads. The length
of any road is less than 500 km, and we can go from any city
to any other by driving along the roads less than 500 km.
When one road was closed for repairs, it turned out that we
can still go from any city to any other on the remaining roads.
Prove that in this case you can drive less than 1500 km.
25. Let n be an even positive integer. Show that there is a
permutation x1 , x2 , ..., xn of 1, 2, ..., n such that for every
1 ≤ i ≤ n the number xi+1 is one of
2xi , 2xi − 1, 2xi − n, 2xi − n − 1 (where we take xn+1 = x1 ).
25. Let n be an even positive integer. Show that there is a
permutation x1 , x2 , ..., xn of 1, 2, ..., n such that for every
1 ≤ i ≤ n the number xi+1 is one of
2xi , 2xi − 1, 2xi − n, 2xi − n − 1 (where we take xn+1 = x1 ).
26. Given a graph with black and white vertices, a movement
consists in changing the color of a vertex and every other
vertex adjacent to it. If we start with a graph G with only
white vertices, is it possible to turn it all black with such
movements?
27. We choose some unit cells from a table of size n × n. Prove
that we can color each chosen cells by red or blue so that in
each row or column the difference between the numbers of red
and blue cells does not excess 1.
27. We choose some unit cells from a table of size n × n. Prove
that we can color each chosen cells by red or blue so that in
each row or column the difference between the numbers of red
and blue cells does not excess 1.
28. In the coordinate plane a rectangle with vertices
(0, 0), (m, 0), (0, n), (m, n) is given where both m and n are
odd integers. The rectangle is partitioned into triangles by
connecting some lattice points of the rectangle in such a way
that
(i) each triangle in the partition has at least one side (to be
called a good side) that lies on a line of the form x = j or
y = k, where j and k are integers, and the altitude on this
side has length 1;
(ii) each bad side (i.e., a side of any triangle in the partition
that is not a good one) is a common side of two triangles in
the partition.
Prove that there exist at least two triangles in the partition
each of which has two good sides.