Given distinct positive integers \( g \) and \( h \), let all integer points on the number line \( OX \) be vertices. Define a directed graph \( G \) as follows: for any integer point \( x \), \( x \rightarrow x + g \), \( x \rightarrow x - h \). For integers \( k, l (k < l) \), let \( G[k, l] \) denote the subgraph of \( G \) with vertices limited to the interval \([k, l]\). Find the largest positive integer \( \alpha \) such that for any integer \( r \), the subgraph \( G[r, r + \alpha - 1] \) of \( G \) is acyclic. Clarify the structure of subgraphs \( G[r, r + \alpha - 1] \) and \( G[r, r + \alpha] \) (i.e., how many connected components and what each component is like).

Let the vertex set \( V \) of a graph be partitioned into \( h \) parts \( (V = V_1 \cup V_2 \cup \cdots \cup V_h) \), with \(|V_1| = n_1, |V_2| = n_2, \ldots, |V_h| = n_h \). If there is an edge between any two vertices only when they belong to different parts, the graph is called a complete \( h \)-partite graph, denoted as \( k(n_1, n_2, \ldots, n_h) \). Let \( n \) and \( r \) be positive integers, \( n \geq 6 \), \( r \leq \frac{2}{3}n \). Consider the complete \( r + 1 \)-partite graph \( k\left(\underbrace{1, 1, \ldots, 1}_{r}, n - r\right) \). Answer the following questions: 1. Find the maximum number of disjoint circles (i.e., circles with no common vertices) in this complete \( r + 1 \)-partite graph. 2. Given \( n \), for all \( r \leq \frac{2}{3}n \), find the maximum number of edges in a complete \( r + 1 \)-partite graph \( k(1, 1, \ldots, 1, n - r) \) where no more than one circle is disjoint.

Points $A$ and $B$ lie on the graph of $y=\log_{2}x$. The midpoint of $\overline{AB}$ is $(6, 2)$. What is the positive difference between the $x$-coordinates of $A$ and $B$? $\textbf{(A)}~2\sqrt{11}\qquad\textbf{(B)}~4\sqrt{3}\qquad\textbf{(C)}~8\qquad\textbf{(D)}~4\sqrt{5}\qquad\textbf{(E)}~9$

A graph has $17$ points and each point has $4$ edges. Show that there are two points which are not joined and which are not both joined to the same point.

There are $n$ vertices and $m > n$ edges in a graph. Each edge is colored either red or blue. In each year, we are allowed to choose a vertex and flip the color of all edges incident to it. Prove that there is a way to color the edges (initially) so that they will never all have the same color

In a small city there are $n$ bus routes, with $n > 1$, and each route has exactly $4$ stops. If any two routes have exactly one common stop, and each pair of stops belongs to exactly one route, find all possible values of $n$.

Given a positive integer number $n$, determine the maximum number of edges a triangle-free Hamiltonian simple graph on $n$ vertices may have.

Draw the graph of the function $y = \frac{| x^3 - x^2 - 2x | }{3} - | x + 1 |$.

Given a graph with $99$ vertices and degrees in $\{81,82,\dots,90\}$, prove that there exist $10$ vertices of this graph with equal degrees and a common neighbour. [i]Proposed by Alireza Alipour[/i]

Let $n$ be a positive integer and let $G$ be a simple undirected graph on $n$ vertices. Let $d_i$ be the degree of its $i$-th vertex, $i = 1, \dots , n$. Denote $\Delta=\max d_i$. Prove that if \[\sum_{i=1}^n d_i^2>n\Delta(n-\Delta),\] then $G$ contains a triangle.

Let $ G$ be a graph with $ 2n$ vertexes and $ 2n(n\minus{}1)$ edges.If we color some edge to red,then vertexes,which are connected by this edge,must be colored to red too. But not necessary that all edges from the red vertex are red. Prove that it is possible to color some vertexes and edges in $ G$,such that all red vertexes has exactly $ n$ red edges.

There are $2^{2n+1}$ towns with $2n+1$ companies and each two towns are connected with airlines from one of the companies. What’s the greatest number $k$ with the following property: We can close $k$ of the companies and their airlines in such way that we can still reach each town from any other (connected graph).

Let $G$ be a simple graph with $n$ vertices and $m$ edges. Two vertices are called [i]neighbours[/i] if there is an edge between them. It turns out the $G$ does not contain any cycles of length from 3 to $2k$ (inclusive), where $k\geq2$ is a given positive integer. a) Prove that it is possible to pick a non-empty set $S$ of vertices of $G$ such that every vertex in $S$ has at least $\left\lceil \frac mn \right\rceil$ neighbours that are in $S$. ($\lceil x\rceil$ denotes the smallest integer larger than or equal to $x$.) b) Suppose a set $S$ as described in (a) is chosen. Let $H$ be the graph consisting of the vertices in $S$ and the edges between those vertices only. Let $v$ be a vertex of $H$. Prove that at least $\left\lceil \left(\frac mn -1\right)^k \right\rceil$ vertices of $H$ can be reached by starting at $v$ and travelling across the edges of $H$ for at most $k$ steps. (Note that $v$ itself satisfies this condition, since it can be reached by starting at $v$ and travelling along the edges of $H$ for 0 steps.)

There are $2019$ coins on a table. Some are placed with head up and others tail up. A group of $2019$ persons perform the following operations: the first person chooses any one coin and then turns it over, the second person choses any two coins and turns them over and so on and the $2019$-th person turns over all the coins. Prove that no matter which sides the coins are up initially, the $2019$ persons can come up with a procedure for turning the coins such that all the coins have smae side up at the end of the operations.

A graph has $n$ points and $\frac{n(n-1)}{2}$ edges. Each edge is colored with one of $k$ colors so that there are no closed monochrome paths. What is the largest possible value of $n$ (given $k$)?

The REAL country has $n$ islands, and there are $n-1$ two-way bridges connecting these islands. Any two islands can be reached through a series of bridges. Arctan, the king of the REAL country, found that it is too difficult to manage $n$ islands, so he wants to bomb some islands and their connecting bridges to divide the country into multiple small areas. Arctan wants the number of connected islands in each group is less than $\delta n$ after bombing these islands, and the island he bomb must be a connected area. Besides, Arctan wants the number of islands to be bombed to be as less as possible. Find all real numbers $\delta$ so that for any positive integer $n$ and the layout of the bridge, the method of bombing the islands is the only one. [i]Proposed by chengbilly[/i]

On the Alphamegacentavra planet there are $2023$ cities, some of which are connected by non-directed flights. It turned out that among any $4$ cities one can find two with no flight between them. Find the maximum number of triples of cities such that between any two of them there is a flight.

[list=1] [*] Let $G$ be a $(4, 4)$ unoriented graph, 2-regulate, containing a cycle with the length 3. Find the characteristic polynomial $P_G (\lambda)$ , its spectrum $Spec (G)$ and draw the graph $G$. [*] Let $G'$ be another 2-regulate graph, having its characteristic polynomial $P_{G'} (\lambda) = \lambda^4 - 4\lambda^2 + \alpha, \alpha \in \mathbb{R}$. Find the spectrum $Spec(G')$ and draw the graph $G'$. [*] Are the graphs $G$ and $G'$ cospectral or isomorphic? [/list]

Lavidópolis is a city with 2024 neighborhoods. Lavi Dopes was elected mayor, and since he saw that there were no roads in the city, he asked Gil Bento, the monster engineer, to design the city's roads according to the following rules: 1. Any two neighborhoods are connected by at most one two-way road; 2. For any two neighborhoods, there is exactly one route from one neighborhood to another, which may pass through some intermediate neighborhoods, but never passes through the same neighborhood more than once. Mayor Lavi Dopes wants to try for re-election, but since he knows nothing about the city and only shows up during campaign times (he spent all this time stealing... I mean, thinking about math problems), he wants to find a pair of neighborhoods such that the number of roads that are part of the route connecting them is maximized among all pairs of neighborhoods. To do this, he starts asking Gil Bento various questions, all in the following manner: he chooses two of the 2024 neighborhoods, say A and B, and asks: "Given neighborhoods A and B, how many roads are part of the route connecting A to B?" Knowing that Gil Bento always answers correctly to each question, determine the minimum number of questions that Lavi Dopes needs to ask to achieve his goal, regardless of how Gil Bento has designed the roads of Lavidópolis.

It is given a graph whose vertices are positive integers and an edge between numbers $a$ and $b$ exists if and only if $a + b + 1 | a^2 + b^2 + 1$. Is this graph connected?

Prove that, for any natural number $n$, the graph of any increasing function $f : [0,1] \to [0, 1]$ can be covered by $n$ rectangles each of area whose sides are parallel to the coordinate axes. Assume that a rectangle includes both its interior and boundary points. (a) Assume that $f(x)$ is continuous on $[0,1]$. (b) Do not assume that $f(x)$ is continuous on $[0,1]$. (A Andjans, Riga) PS. (a) for O Level, (b) for A Level

On a table there are $100$ red and $k$ white buckets for which all of them are initially empty. In each move, a red and a white bucket is selected and an equal amount of water is added to both of them. After some number of moves, there is no empty bucket and for every pair of buckets that are selected together at least once during the moves, the amount of water in these buckets is the same. Find all the possible values of $k$.

It is known that in a group of $2024$ students each student has at least $1011$ acquaintances among the remaining members of the group. What is more, there exists a student that has at least $1012$ acquaintances in the group. Prove that for every pair of students $X, Y$, there exist students $X_0 = X, X_1, ..., X_{n - 1}, X_n = Y$ in the group such that for every index $i = 0, ..., n - 1$, the students $X_i$ and $X_{i + 1}$ are acquaintances. [i]Proposed by Mirko Petruševski[/i]

There are $2019$ coins on a table. Some are placed with head up and others tail up. A group of $2019$ persons perform the following operations: the first person chooses any one coin and then turns it over, the second person choses any two coins and turns them over and so on and the $2019$-th person turns over all the coins. Prove that no matter which sides the coins are up initially, the $2019$ persons can come up with a procedure for turning the coins such that all the coins have smae side up at the end of the operations.

Five girls and five boys took part in a competition. Suppose that we can number the boys and girls $1, 2, 3, 4, 5$ such that for each $1 \leq i,j \leq 5$, there are exactly $|i-j|$ contestants that the girl numbered $i$ and the boy numbered $j$ both know. Let $a_i$ and $b_i$ be the number of contestants that the girl numbered $i$ knows and the number of contestants that the boy numbered $i$ knows respectively. Find the minimum value of $\max(\sum\limits_{i=1}^5a_i, \sum\limits_{i=1}^5b_i)$. (Note that for a pair of contestants $A$ and $B$, $A$ knowing $B$ doesn't mean that $B$ knows $A$ and a contestant cannot know themself.)