Proof of the Erdős–Faudree Conjecture on Quadrilaterals

In this paper, we prove the Erdős–Faudree’s conjecture: If G is a graph of order 4k and the minimum degree of G is at least 2k then G contains k disjoint cycles of length 4.     

Variants of the Erdős–Szekeres and Erdős–Hajnal Ramsey problems

Given integers $\ell ,n$, the $\ell$th power of the path $P_n$ is the ordered graph $P_n^{\ell }$ with vertex set $v_1<v_2<\cdots <v_n$ and all edges of the form $v_i{v}_j$ where $|i-j|\le \ell$. The Ramsey number $r(P_n^{\ell },P_n^{\ell })$ is the minimum $N$ such that every 2-coloring of $\left(\genfrac{}{}{0ex}{}{\left[N\right]}{2}\right)$ results in a monochromatic copy of $P_n^{\ell }$. It is well-known that $r(P_n^1,P_n^1)={(n-1)}^2+1$. For $\ell >1$, Balko–Cibulka–Král–Kynčl proved that $r(P_n^{\ell },P_n^{\ell })<c_{\ell }{n}^{128\ell }$ and asked for the growth rate for fixed $\ell$. When $\ell =2$, we improve this upper bound substantially by proving $r(P_n^2,P_n^2)<c{n}^{19.5}$. Using this result, we determine the correct tower growth rate of the $k$-uniform hypergraph Ramsey number of a $(k+1)$-clique versus an ordered tight path. Finally, we consider an ordered version of the classical Erdős–Hajnal hypergraph Ramsey problem, improve the tower height given by the trivial upper bound, and conjecture that this tower height is optimal.     

Erdős-Turʼan-Type Discrepancy for the Zeros of Rational Functions

In 1950 P. Erdős and P. Turán published a discrepancy theorem for the zeros of a polynomial. Therein, the maximum deviation of the normalized zero counting measure from the equilibrium measure of the unit circle is estimated. Many other discrepancy theorems and related propositions about weak-star-convergence of the zero distribution of a sequence of polynomials were proved during the last decades. For several years the weak-star-convergence of the zero distribution of a sequence of rational functions is also studied. The main result of this paper is a discrepancy theorem for the zero distribution of a rational function which generalizes and sharpens previous propositions about weak-star-convergence of the zero counting measure of sequences of rational functions and known discrepancy theorems for polynomials.     

On the proof of Erdős’ inequality

Using undergraduate calculus, we give a direct elementary proof of a sharp Markov-type inequality \({\left\| {p'} \right\|_{\left[ { - 1,1} \right]}} \leqslant \frac{1}{2}{\left\| p \right\|_{\left[ { - 1,1} \right]}}\) for a constrained polynomial p of degree at most n, initially claimed by P. Erd?s, which is different from the one in the paper of T.Erdélyi (2015). Whereafter, we give the situations on which the equality holds. On the basis of this inequality, we study the monotone polynomial which has only real zeros all but one outside of the interval (?1, 1) and establish a new asymptotically sharp inequality.     

A stability version for a theorem of Erdős on nonhamiltonian graphs

Let $n,d$ be integers with $1\le d\le ?\frac{n?1}{2}?$, and set $h(n,d)?\left(\genfrac{}{}{0ex}{}{n?d}{2}\right)+d^2$ and $e(n,d)?max\{h(n,d),h(n,?\frac{n?1}{2}?)\}$. Because $h(n,d)$ is quadratic in $d$, there exists a $d_0\left(n\right)=(n∕6)+O\left(1\right)$ such that

$e(n,1)>e(n,2)>?>e(n,d_0)=e(n,d_0+1)=?=e\left(n,?\frac{n?1}{2}?\right).$

A theorem by Erd?s states that for $d\le ?\frac{n?1}{2}?$, any $n$-vertex nonhamiltonian graph $G$ with minimum degree $\delta \left(G\right)\ge d$ has at most $e(n,d)$ edges, and for $d>d_0\left(n\right)$ the unique sharpness example is simply the graph $K_n?E\left(K_{?(n+1)∕2?}\right)$. Erd?s also presented a sharpness example $H_{n,d}$ for each $1\le d\le d_0\left(n\right)$.We show that if $d<d_0\left(n\right)$ and a $2$-connected, nonhamiltonian $n$-vertex graph $G$ with $\delta \left(G\right)\ge d$ has more than $e(n,d+1)$ edges, then $G$ is a subgraph of $H_{n,d}$. Note that $e(n,d)?e(n,d+1)=n?3d?2\ge n∕2$ whenever $d<d_0\left(n\right)?1$.     

On a problem of Erdős

Let s≥2 be an integer. Denote by f ₁(s) the least integer so that every integer l>f ₁(s) is the sum of s distinct primes. Erd?s proved that f ₁(s)<p ₁+p ₂+?+p _s +Cslogs, where p _i is the ith prime and C is an absolute constant. In this paper, we prove that f ₁(s)=p ₁+p ₂+?+p _s +(1+o(1))slogs=p ₂+p ₃+?+p _s+1+o(slogs). This answers a question posed by P. Erd?s.     

A note on Chowʼs entropy functional for the Gauss curvature flow

Based on the entropy formula for the Gauss curvature flow introduced by Bennett Chow, we define an entropy functional that is monotone along the unnormalized flow and whose critical point is a shrinking self-similar solution.     

A Question from a Famous Paper of Erdős

Given a convex body $K$ K , consider the smallest number $N$ N so that there is a point $P\in \partial K$ P ∈ ? K such that every circle centred at $P$ P intersects $\partial K$ ? K in at most $N$ N points. In 1946 Erd?s conjectured that $N=2$ N = 2 for all $K$ K , but there are convex bodies for which this is not the case. As far as we know there is no known global upper bound. We show that no convex body has $N=\infty $ N = ∞ and that there are convex bodies for which $N = 6$ N = 6 .     

Tauberian Theorem of Erdős Revisited

Dedicated to the memory of Paul Erdős In connection with the elementary proof of the prime number theorem, Erdős obtained a striking quadratic Tauberian theorem for sequences. Somewhat later, Siegel indicated in a letter how a powerful "fundamental relation" could be used to simplify the difficult combinatorial proof. Here the author presents his version of the (unpublished) Erdős–Siegel proof. Related Tauberian results by the author are described. Received December 20, 1999     

A note on Rubin's methods of the use of two Euler systems

Here we show that Rubin’s method of the use of two Euler systems to the proofs of Iwasawa main conjectures of the rational number field and of an imaginary quadratic field is only proper to these two kinds of number fields. We mainly use the properties of adéle ring and idéle group in class field theory to get the result.     

A conjecture of Erdős and Reddy and the rational approximation of Mittag-Leffler type functions

Пусть \(f(z) = \mathop \sum \limits_{k = 0}^\infty a_k z^k ,a_0 \ne 0, a_k \geqq 0 (k \geqq 0)\) — целая функци я,π _n — класс обыкновен ных алгебраических мног очленов степени не вы ше \(n,a \lambda _n (f) = \mathop {\inf }\limits_{p \in \pi _n } \mathop {\sup }\limits_{x \geqq 0} |1/f(x) - 1/p(x)|\) . П. Эрдеш и А. Редди высказали пр едположение, что еслиf(z) имеет порядок ?ε(0, ∞) и $$\mathop {\lim sup}\limits_{n \to \infty } \lambda _n^{1/n} (f)< 1, TO \mathop {\lim inf}\limits_{n \to \infty } \lambda _n^{1/n} (f) > 0$$ В данной статье показ ано, что для целой функ ции $$E_\omega (z) = \mathop \sum \limits_{n = 0}^\infty \frac{{z^n }}{{\Gamma (1 + n\omega (n))}}$$ , где выполняется $$\lambda _n^{1/n} (E_\omega ) \leqq \exp \left\{ { - \frac{{\omega (n)}}{{e + 1}}} \right\}$$ , т.е. $$\mathop {\lim sup}\limits_{n \to \infty } \lambda _n^{1/n} (E_\omega ) \leqq \exp \left\{ { - \frac{1}{{\rho (e + 1)}}} \right\}< 1, a \mathop {\lim inf}\limits_{n \to \infty } \lambda _n^{1/n} (E_\omega ) = 0$$ . ФункцияE _ω (z) имеет порядок ?.     

A fractional version of the Erdős-Faber-Lovász conjecture

LetH be any hypergraph in which any two edges have at most one vertex in common. We prove that one can assign non-negative real weights to the matchings ofH summing to at most |V(H)|, such that for every edge the sum of the weights of the matchings containing it is at least 1. This is a fractional form of the Erds-Faber-Lovász conjecture, which in effect asserts that such weights exist and can be chosen 0,1-valued. We also prove a similar fractional version of a conjecture of Larman, and a common generalization of the two.Supported in part by NSF grant MCS 83-01867, AFOSR Grant 0271 and a Sloan Research Fellowship