相关论文: Exact solutions to the Erd\H{o}s-Rothschild proble…

In the Exact Matching problem, we are given a graph whose edges are colored red or blue and the task is to decide for a given integer k, if there is a perfect matching with exactly k red edges. Since 1987 it is known that the Exact Matching…

The classical stability theorem of Erd\H{o}s and Simonovits states that, for any fixed graph with chromatic number $k+1 \ge 3$, the following holds: every $n$-vertex graph that is $H$-free and has within $o(n^2)$ of the maximal possible…

Erd\H{o}s proved an upper bound on the number of edges in an $n$-vertex non-Hamiltonian graph with given minimum degree and showed sharpness via two members of a particular graph family. F\"{u}redi, Kostochka and Luo showed that these two…

This paper considers an edge minimization problem in saturated bipartite graphs. An $n$ by $n$ bipartite graph $G$ is $H$-saturated if $G$ does not contain a subgraph isomorphic to $H$ but adding any missing edge to $G$ creates a copy of…

We provide multicolored and infinite generalizations for a Ramsey-type problem raised by Bollob\'as, concerning colorings of $K_n$ where each color is well-represented. Let $\chi$ be a coloring of the edges of a complete graph on $n$…

What is the minimum number of triangles in a graph of given order and size? Motivated by earlier results of Mantel and Tur\'an, Rademacher solved the first non-trivial case of this problem in 1941. The problem was revived by Erd\H{o}s in…

Let $n, d$ be integers with $1 \leq d \leq \left \lfloor \frac{n-1}{2} \right \rfloor$, and set $h(n,d):={n-d \choose 2} + d^2$. Erd\H{o}s proved that when $n \geq 6d$, each nonhamiltonian graph $G$ on $n$ vertices with minimum degree…

Let $H$ be a fixed graph. Denote $f(n,H)$ to be the maximum number of edges not contained in any monochromatic copy of $H$ in a 2-edge-coloring of the complete graph $K_n$, and $ex(n,H)$ to be the {\it Tur\'an number} of $H$. An easy lower…

Motivated by an extremal problem on graph-codes that links coding theory and graph theory, Alon recently proposed a question aiming to find the smallest number $t$ such that there is an edge coloring of $K_{n}$ by $t$ colors with no copy of…

Krenn, Gu and Zeilinger initiated the study of PMValid edge-colourings because of its connection to a problem from quantum physics. A graph is defined to have a PMValid $k$-edge-colouring if it admits a $k$-edge-colouring (i.e. an edge…

We study the extremal problem that relates the spectral radius $\lambda (G)$ of an $F$-free graph $G$ with its number of edges. Firstly, we prove that for any graph $F$ with chromatic number $\chi (F)=r+1\ge 3$, if $G$ is an $F$-free graph…

The extremal problem of hypergraph colorings related to Erd\H{o}s--Hajnal property $B$-problem is considered. Let $k$ be a natural number. The problem is to find the value of $m_k(n)$ equal to the minimal number of edges in an $n$-uniform…

Let $n, d$ be integers with $1 \leq d \leq \left \lfloor \frac{n-1}{2} \right \rfloor$, and set $h(n,d):={n-d \choose 2} + d^2$ and $e(n,d):= \max\{h(n,d),h(n, \left \lfloor \frac{n-1}{2} \right \rfloor)\}$. Because $h(n,d)$ is quadratic in…

A fundamental problem of extremal graph theory is to ask, 'What is the maximum number of edges in an $F$-free graph on $n$ vertices?' Recently Alon and Shikhelman proposed a more general, subgraph counting, version of this question. They…

A graph is called $k$-critical if its chromatic number is $k$ but any proper subgraph has chromatic number less than $k$. An old and important problem in graph theory asks to determine the maximum number of edges in an $n$-vertex…

A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. The simplest case of another problem, stated by the same…

A $k$-edge-coloured graph is colour-balanced if each colour appears equally often. Resolving a conjecture of Pardey and Rautenbach, we show that any colour-balanced $k$-edge-coloured complete graph $K_{2kt}$ contains a perfect matching that…

We study the following question: how few edges can we delete from any $H$-free graph on $n$ vertices in order to make the resulting graph $k$-colorable? It turns out that various classical problems in extremal graph theory are special cases…

Let $H$ be a hypergraph. For a $k$-edge coloring $c : E(H) \to \{1,...,k\}$ let $f(H,c)$ be the number of components in the subhypergraph induced by the color class with the least number of components. Let $f_k(H)$ be the maximum possible…

We study $\mathrm{exa}_k(n,F)$, the largest number of edges in an $n$-vertex graph $G$ that contains exactly $k$ copies of a given subgraph $F$. The case $k=0$ is the Tur\'an number $\mathrm{ex}(n,F)$ that is among the most studied…