相关论文: Erd\H{o}s' problem and $(n, \frac{1}{3})$-separate…

We give a probabilistic construction of a $3$-uniform hypergraph on $N$ vertices with independence number $O(\log N / \log \log N)$ in which there are at most two edges among any four vertices. This bound is tight and solves a longstanding…

In this paper, we present rotational and self-similar solutions for the compressible Euler equations in R^3 using the separation method. These solutions partly complement Yuen's irrotational and elliptic solutions in R^3 [Commun. Nonlinear…

We help Alice play a certain "convergence game" against Bob and win the prize, which is a constructive solution to a problem by Erd\H{o}s and Graham, posed in their 1980 book on open questions in combinatorial number theory. Namely, after…

We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…

Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…

The development of the theory of three-dimensional harmonic mappings is considered. The new classes of mappings that generate three-dimensional harmonic functions are introduced. The physical interpretation of these mappings is applied to…

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

In this note, we present a substantial improvement on the computational complexity of the Erd\"{o}s-Szekeres partitioning problem and review recent works on dynamic \textsf{LIS}.

Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for…

The Ramsey multiplicity problem asks for the minimum asymptotic density of monochromatic labelled copies of a graph $H$ in a red/blue colouring of the edges of $K_n$. We introduce an off-diagonal generalization in which the goal is to…

In 1988, Erd\H{o}s suggested the question of minimizing the number of edges in a connected $n$-vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In…

We propose a set of questions on the dynamics of H\'enon maps from the real, complex, algebraic and arithmetic points of view.

New partial results are obtained related to the following old problem of Erd\"os: for any infinite set $X$ of real numbers to show that there is always a measurable (or, equivalently, closed) subset of reals of positive Lebesgue measure…

We establish a variety of extensions to the Erdos-Rado Theorem, particularly involving ordinal numbers, and always involving ordinary partition relations. Most of the results can be regarded as consequences of the Ramification Principle,…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

For natural numbers $n,r \in \mathbb{N}$ with $n\ge r$, the Kneser graph $K(n,r)$ is the graph on the family of $r$-element subsets of $\{1,\dots,n\}$ in which two sets are adjacent if and only if they are disjoint. Delete the edges of…

The study of ordered Ramsey numbers of monotone paths for graphs and hypergraphs has a long history, going back to the celebrated work by Erd\H{o}s and Szekeres in the early days of Ramsey theory. In this paper we obtain several results in…

In this paper we make a Gaussian integer version of the Erd\H{o}s-Straus conjecture and we solve the Erd\H{o}s-Straus diophantine equation over the rings of integers of norm-Euclidean quadratic fields.

Erd\H{o}s and Hajnal proposed a problem that: is it true that every $(2n+1)$-vertex graph with $n^2+n+1$ edges contains two vertices of equal degree connected by a path of length three? The edge bound is sharp by the complete bipartite…

In [1], we have presented the theoretical background for finding the Elementary Invariants for a 3D system of first order rational differential equations (1ODEs). We have also provided an algorithm to find such Invariants. Here we introduce…