相关论文: On Tur\'an-type problems and the abstract chromati…

Over the past decade, physicists have developed deep but non-rigorous techniques for studying phase transitions in discrete structures. Recently, their ideas have been harnessed to obtain improved rigorous results on the phase transitions…

We are given graphs $H_1,\dots,H_k$ and $F$. Consider an $F$-free graph $G$ on $n$ vertices. What is the largest sum of the number of copies of $H_i$? The case $k=1$ has attracted a lot of attention. We also consider a colored variant,…

We consider unavoidable chromatic patterns in $2$-colorings of the edges of the complete graph. Several such problems are explored being a junction point between Ramsey theory, extremal graph theory (Tur\'an type problems), zero-sum Ramsey…

By Kolmogorov Complexity,two number-theoretic problems are solved in different way than before,one problem is Maxim Kontsevich and Don Bernard Zagier's Problem 3 \emph{Exhibit at least one number which does not belong to} $ \mathcal{P}$…

The main result is a common generalization of results on lower bounds for the chromatic number of r-uniform hypergraphs and some of the major theorems in Tverberg-type theory, which is concerned with the intersection pattern of faces in a…

Let $F$ be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of $F$ in a graph with a prescribed number of vertices and edges. Our results extend those of Simonovits,…

We study an analogue of the Ramsey multiplicity problem for additive structures, in particular establishing the minimum number of monochromatic 3-APs in 3-colorings of $\mathbb{F}_3^n$ as well as obtaining the first non-trivial lower bound…

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…

Let \( \mathcal{F} \) be a family of graphs. The generalized Tur\'an number \( \operatorname{ex}(n, K_r, \mathcal{F}) \) is the maximum number of $K_r$ in an \( n \)-vertex graph that does not contain any member of \( \mathcal{F} \) as a…

Imagine that you are handed a rule for determining whether a cycle in a digraph is "good" or "bad", based on which edges of the cycle are traversed in the forward direction and which edges are traversed in the backward direction. Can you…

Let R be a commutative ring with unity (not necessarily finite). The ring R consider as a simple graph whose vertices are the elements of R with two distinct vertices x and y are adjacent if xy=0 in R, where 0 is the zero element of R. In…

Colored interlacing triangles, introduced by Aggarwal-Borodin-Wheeler (2024), provide the combinatorial framework for the Central Limit Theorem for probability measures arising from the Lascoux-Leclerc-Thibon (LLT) polynomials. Colored…

Let $X$ be a (repetitive) infinite connected simple graph with a finite upper bound $\Delta$ on the vertex degrees. The main theorem states that $X$ admits a (repetitive) limit aperiodic vertex coloring by $\Delta$ colors. This refines a…

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$…

This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…

Turaev Viro invariants are amongst the most powerful tools to distinguish 3-manifolds: They are implemented in mathematical software, and allow practical computations. The invariants can be computed purely combinatorially by enumerating…

This paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turan's theorem, which…

We study thresholds for extremal properties of random discrete structures. We determine the threshold for Szemer\'edi's theorem on arithmetic progressions in random subsets of the integers and its multidimensional extensions and we…

We consider natural generalization of plane chromatic number problem. We consider chromatic numbers $\chi$ of spaces $\mathbb{R}^n \times [0,\varepsilon]^k$ for arbitrary small $\varepsilon$. We prove that $5 \leq\chi(\mathbb{R}^2\times…