In the fictional country of Mahishmati, there are $50$ cities, including a capital city. Some pairs of cities are connected by two-way flights. Given a city $A$, an ordered list of cities $C_1,\ldots, C_{50}$ is called an [i]antitour[/i] from $A$ if [list] [*] every city (including $A$) appears in the list exactly once, and [*] for each $k\in \{1,2,\ldots, 50\}$, it is impossible to go from $A$ to $C_k$ by a sequence of exactly $k$ (not necessarily distinct) flights. [/list] Baahubali notices that there is an antitour from $A$ for any city $A$. Further, he can take a sequence of flights, starting from the capital and passing through each city exactly once. Find the least possible total number of antitours from the capital city. [i]Proposed by Sutanay Bhattacharya[/i]

Determine the largest integer $n\geq 3$ for which the edges of the complete graph on $n$ vertices can be assigned pairwise distinct non-negative integers such that the edges of every triangle have numbers which form an arithmetic progression.

In a group of people, there are some mutually friendly pairs. For positive integer $k\ge3$ we say the group is $k$-great, if every (unordered) $k$-tuple of people from the group can be seated around a round table it the way that all pairs of neighbors are mutually friendly. [i](Since this was the 67th year of CZE/SVK MO,)[/i] show that if the group is 6-great, then it is 7-great as well. [b]Bonus[/b] (not included in the competition): Determine all positive integers $k\ge3$ for which, if the group is $k$-great, then it is $(k+1)$-great as well.

Find the smallest positive constant $c$ satisfying: For any simple graph $G=G(V,E)$, if $|E|\geq c|V|$, then $G$ contains $2$ cycles with no common vertex, and one of them contains a chord. Note: The cycle of graph $G(V,E)$ is a set of distinct vertices ${v_1,v_2...,v_n}\subseteq V$, $v_iv_{i+1}\in E$ for all $1\leq i\leq n$ $(n\geq 3, v_{n+1}=v_1)$; a cycle containing a chord is the cycle ${v_1,v_2...,v_n}$, such that there exist $i,j, 1< i-j< n-1$, satisfying $v_iv_j\in E$.

In the space there are 8 points that no four of them are in the plane. 17 of the connecting segments are coloured blue and the other segments are to be coloured red. Prove that this colouring will create at least four triangles. Prove also that four cannot be subsituted by five. Remark: Blue triangles are those triangles whose three edges are coloured blue.

Prove that for any finite bipartite planar graph, a circle can be assigned to each vertex so that all circles are coplanar, the circles assigned to any two adjacent vertices are tangent to one another, while the circles assigned to any two distinct, non-adjacent vertices intersect in two points.

In a group of nine persons it is not possible to choose four persons such that every one knows the three others. Prove that this group of nine persons can be partitioned into four groups such that nobody knows anyone from his or her group.

There are 2002 towns in a kingdom. Some of the towns are connected by roads in such a manner that, if all roads from one city closed, one can still travel between any two cities. Every year, the kingdom chooses a non-self-intersecting cycle of roads, founds a new town, connects it by roads with each city from the chosen cycle, and closes all the roads from the original cycle. After several years, no non-self-intersecting cycles remained. Prove that at that moment there are at least 2002 towns, exactly one road going out from each of them.

Let $a_n=1+n!(\frac{1}{0!}+\frac{1}{1!}+\frac{1}{2!}+...+\frac{1}{n!})$ for any $n\in \mathbb{Z}^{+}$. Consider $a_n$ points in the plane,no $3$ of them collinear.The segments between any $2$ of them are colored in one of $n$ colors. Prove that among them there exist $3$ points forming a monochromatic triangle.

Finite number of $2017$ units long sticks are fixed on a plate. Each stick has a bead that can slide up and down on it. Beads can only stand on integer heights $( 1, 2, 3,..., 2017 )$. Some of the bead pairs are connected with elastic bands. $The$ $young$ $ant$ can go to every bead, starting from any bead by using the elastic bands. $The$ $old$ $ant$ can use an elastic band if the difference in height of the beads which are connected by the band, is smaller than or equal to $1$. If the heights of the beads which are connected to each other are different, we call it $valid$ $situation$. If there exists at least one $valid$ $situation$, prove that we can create a $valid$ $situation$, by arranging the heights of the beads, in which $the$ $old$ $ant$ can go to every bead, starting from any bead.

On a planet there are $M$ countries and $N$ cities. There are two-way roads between some of the cities. It is given that: (1) In each county there are at least three cities; (2) For each country and each city in the country is connected by roads with at least half of the other cities in the countries; (3) Each city is connceted with exactly one other city ,that is not in its country; (4) There are at most two roads between cities from cities in two different countries; (5) If two countries contain less than $2M$ cities in total then there is a road between them. Prove that there is cycle of lenght at least $M+\frac{N}{2}$.

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Some cities of a country consisting of $n$ cities are connected by round trip flights so that there are at least $k$ flights from any city and any city is reachable from any city. Prove that for any such flight organization these flights can be distributed among $n-k$ air companies so that one can reach any city from any city by using of at most one flight of each air company.

There are 2000 cities in a country and no roads. Prove that some cities can be connected by a road such that there would be 2 cities with 1 road passing through them, there would be 2 cities with 2 roads passim through them,...,there would be 2 cities with 1000 roads passing through them. [I]Proposed by F. Bakharev[/i]

A graph $G$ has $n$ vertices ($n>1$). For each edge $e$ let $c(e)$ be the number of vertices of the largest complete subgraph containing $e$. Prove that the inequality (the summation is over all edges of $G$): \[\sum_{e} \frac{c(e)}{c(e)-1}\le \frac{n^2}{2}.\]

There are $2024$ cities in a country, every two of which are bidirectionally connected by exactly one of three modes of transportation - rail, air, or road. A tourist has arrived in this country and has the entire transportation scheme. He chooses a travel ticket for one of the modes of transportation and the city from which he starts his trip. He wants to visit as many cities as possible, but using only the ticket for the specified type of transportation. What is the largest $k$ for which the tourist will always be able to visit at least $k$ cities? During the route, he can return to the cities he has already visited. [i]Proposed by Bogdan Rublov[/i]

14 students attend the IMO training camp. Every student has at least $k$ favourite numbers. The organisers want to give each student a shirt with one of the student's favourite numbers on the back. Determine the least $k$, such that this is always possible if: $a)$ The students can be arranged in a circle such that every two students sitting next to one another have different numbers. $b)$ $7$ of the students are boys, the rest are girls, and there isn't a boy and a girl with the same number.

Given a graph with $n \geq 4$ vertices. It is known that for any two of vertices there is a vertex connected with none of these two vertices. Find the greatest possible number of the edges in the graph.

Here $G_{n}$ denotes a simple undirected graph with $n$ vertices, $K_{n}$ denotes the complete graph with $n$ vertices, $K_{n,m}$ the complete bipartite graph whose components have $m$ and $n$ vertices, and $C_{n}$ a circuit with $n$ vertices. The number of edges in the graph $G_{n}$ is denoted $e(G_{n})$. If $n \geq 5$ and $e(G_{n}) \geq \frac{n^{2}}{4}+2$, prove that $G_{n}$ contains two triangles that share exactly one vertex.

Let $n$ and $\ell$ be integers such that $n \ge 3$ and $1 < \ell < n$. A country has $n$ cities. Between any two cities $A$ and $B$, either there is no flight from $A$ to $B$ and also none from $B$ to $A$, or there is a unique [i]two-way trip[/i] between them. A [i]two-way trip[/i] is a flight from $A$ to $B$ and a flight from $B$ to $A$. There exist two cities such that the least possible number of flights required to travel from one of them to the other is $\ell$. Find the maximum number of two-way trips among the $n$ cities.

Call a simple graph $G$ [i]quasicolorable[/i] if we can color each edge blue, red, green, or white such that [list] [*] for each vertex v of degree 3 in G, the three edges incident to v are either (1) red, green, and blue, or (2) all white, [*] not all edges are white. [/list] A simple connected graph $G$ has $a$ vertices of degree $4$, $b$ vertices of degree $3$, and no other vertices, where $a$ and $b$ are positive integers. Find the smallest real number $c$ so that the following statement is true: “If $a/b > c$, then $G$ must be quasicolorable.”

Let $n\geq 3$ be a fixed integer. Each side and each diagonal of a regular $n$-gon is labelled with a number from the set $\left\{1;\;2;\;...;\;r\right\}$ in a way such that the following two conditions are fulfilled: [b]1.[/b] Each number from the set $\left\{1;\;2;\;...;\;r\right\}$ occurs at least once as a label. [b]2.[/b] In each triangle formed by three vertices of the $n$-gon, two of the sides are labelled with the same number, and this number is greater than the label of the third side. [b](a)[/b] Find the maximal $r$ for which such a labelling is possible. [b](b)[/b] [i]Harder version (IMO Shortlist 2005):[/i] For this maximal value of $r$, how many such labellings are there? [hide="Easier version (5th German TST 2006) - contains answer to the harder version"] [i]Easier version (5th German TST 2006):[/i] Show that, for this maximal value of $r$, there are exactly $\frac{n!\left(n-1\right)!}{2^{n-1}}$ possible labellings.[/hide] [i]Proposed by Federico Ardila, Colombia[/i]

Let $n\ge 3$ be an integer. In a country there are $n$ airports and $n$ airlines operating two-way flights. For each airline, there is an odd integer $m\ge 3$, and $m$ distinct airports $c_1, \dots, c_m$, where the flights offered by the airline are exactly those between the following pairs of airports: $c_1$ and $c_2$; $c_2$ and $c_3$; $\dots$ ; $c_{m-1}$ and $c_m$; $c_m$ and $c_1$. Prove that there is a closed route consisting of an odd number of flights where no two flights are operated by the same airline.

In a simple graph, there are two disjoint set of vertices $A$ and $B$ where $A$ has $k$ and $B$ has $2016$ vertices. Four numbers are written to each vertex using the colors red, green, blue and black. There is no any edge at the beginning. For each vertex in $A$, we first choose a color and then draw all edges from this vertex to the vertices in $B$ having a larger number with the chosen color. It is known that for each vertex in $B$, the set of vertices in $A$ connected to this vertex are different. Find the minimal possible value of $k$.

A complete graph of $n$ vertices is a set of $n$ vertices and those vertices are connected in pairs by edges. Suppose the graph has $n$ vertices $A_1, A_2, ..., A_n$, the cycle is a set of edges of the form $A_{i_1}A_{i_2}, A_{i_2}A_{i_3},..., A_{i_m}A_{i_1}$ with $i_1, i_2, ..., i_m \in {1, 2, ..., n}$ double one different. We call $m$ the length of this cycle. Find the smallest positive integer$ n$ such that for every way of coloring all edges of a complete graph of $n$ vertices, each edge filled with one of three different colors, there is always a cycle of even length with the same color. PS. The same problem with another wording [url=https://artofproblemsolving.com/community/c6h151391p852296]here [/url].