A graph is called Bipartite if it is possible to split all its vertices into two groups in such a way that there are no edges connecting vertices from the same group. Find out whic of the following graphs are bipartite and which are not:
Imagine you are a manager of a very special hotel, a hotel with an infinite number of rooms, where each room has a natural number on the door
You will have to deal with unusual situations that may occur.
Show that a bipartite graph with
In a graph
Let
A new customer comes to the hotel and wants a room. It happened today that all the rooms are occupied. What should you do?
Now imagine you got
The next day you have even harder situation: to the hotel, where all the rooms are occupied arrives a bus with infinitely many new customers. In the bus all the seats have numbers
Imagine you have
What would you do about
Imagine you have now a general finite number of new guests arriving to the full hotel. What do you do?