相关论文: Generalizations of the Ruzsa-Szemer\'edi and rainb…

Let $\mathcal{G}_n^k=\{G_1,G_2,\ldots,G_k\}$ be a multiset of graphs on vertex set $[n]$ and let $F$ be a fixed graph with edge set $F=\{e_1, e_2,\ldots, e_m\}$ and $k\ge m$. We say ${\mathcal{G}_n^k}$ is rainbow $F$-free if there is no…

There has been extensive studies on the following question: given $k$ graphs $G_1,\dots, G_k$ over a common vertex set of size $n$, what conditions on $G_i$ ensures a `colorful' copy of $H$, i.e., a copy of $H$ containing at most one edge…

We consider three extremal problems about the number of copies of a fixed graph in another larger graph. First, we correct an error in a result of Reiher and Wagner and prove that the number of $k$-edge stars in a graph with density $x \in…

The Kneser graph $K(n,k)$ is defined for integers $n$ and $k$ with $n \geq 2k$ as the graph whose vertices are all the $k$-subsets of $[n]=\{1,2,\ldots,n\}$ where two such sets are adjacent if they are disjoint. The Schrijver graph $S(n,k)$…

We study the following generalization of the Tur\'an problem in sparse random graphs. Given graphs $T$ and $H$, let $\mathrm{ex}\big(G(n,p), T, H\big)$ be the random variable that counts the largest number of copies of $T$ in a subgraph of…

Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Tur\'an number $\mathrm{ex}(n,T,\mathcal{F})$ is the maximum number of copies of $T$ in an $n$-vertex $\mathcal{F}$-free graph. We prove a general theorem which states…

Let $k$ and $n$ be two integers, with $k\geq 3$, $n\equiv 0\pmod k$, and $n$ sufficiently large. We determine the $(k-1)$-degree threshold for the existence of a rainbow perfect matchings in $n$-vertex $k$-uniform hypergraph. This implies…

A balanced edge-coloring of the complete graph is an edge-coloring such that every vertex is incident to each color the same number of times. In this short note, we present a construction of a balanced edge-coloring with six colors of the…

A well known result due to Andr\'asfai, Erd\H{o}s, and S\'os asserts that for $r\ge 2$ every $K_{r+1}$-free graph on $n$ vertices with $\delta(G)>\frac{3r-4}{3r-1}n$ is $r$-partite. We study related questions in the context of weighted…

For graphs $T, H$, let $ex(n,T,H)$ denote the maximum number of copies of $T$ in an $n$-vertex $H$-free graph. In this paper we prove some sharp results on this generalization of Tur\'an numbers, where our focus is for the graphs $T,H$…

Let $r(G,H)$ be the smallest integer $N$ such that for any $2$-coloring (say, red and blue) of the edges of $K\_n$, $n\geqslant N$, there is either a red copy of $G$ or a blue copy of $H$. Let $K\_n-K\_{1,s}$ be the complete graph on $n$…

We show that for $m, r \in \mathbb{N}$ and $N > (2m+1)^r (r!)^{1/m}$, every $r$-coloring of the integers in the interval $[N]$ contains a monochromatic solution to the equation \[ x_1 + \dots + \dots x_{m+1} = y_1 + \dots + y_m. \] This…

There are several topological results ensuring the existence of a large complete bipartite subgraph in any properly colored graph satisfying some special topological regularity conditions. In view of $\mathbb{Z}_p$-Tucker lemma, Alishahi…

Let $\mathcal{H}$ be a hypergraph and $F$ be a graph. If there exists a bijection between the hyperedges of $\mathcal{H}$ and the edges of $F$ such that each hyperedge contains its image, then we say that $\mathcal{H}$ is a \textit{Berge…

Write $K^{(k)}_{n}$ for the complete $k$-graph on $n$ vertices. For $2 \leq k \leq g < r$ integers, let $\pi\left(n, K^{(k)}_{g}, K^{(k)}_r\right)$ be the maximum density of $K^{(k)}_{g}$ in $n$ vertex $K^{(k)}_{r}$-free $k$-graphs. The…

A standard proof of Schur's Theorem yields that any $r$-coloring of $\{1,2,\dots,R_r-1\}$ yields a monochromatic solution to $x+y=z$, where $R_r$ is the classical $r$-color Ramsey number, the minimum $N$ such that any $r$-coloring of a…

Ryser's conjecture says that for every $r$-partite hypergraph $H$ with matching number $\nu(H)$, the vertex cover number is at most $(r-1)\nu(H)$. This far reaching generalization of K\"onig's theorem is only known to be true for $r\leq 3$,…

In this paper, we introduce Euclidean Gallai-Ramsey theory, by combining Euclidean Ramsey theory and Gallai-Ramsey theory on graphs. More precisely, we consider the following problem: For an integer $r$ and configurations $K$ and $K'$, does…

An edge-colored graph $F$ is rainbow if each edge of $F$ has a unique color. The rainbow Tur\'an number $ex^*(n,F)$ of a graph $F$ is the maximum possible number of edges in a properly edge-colored $n$-vertex graph with no rainbow copy of…

Let $n(k_1, k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set of size $k_2$. Recently, Feige and Pauzner showed that ${n(k,…