Titlebook: Erdös Centennial; László Lovász,Imre Z. Ruzsa,Vera T. Sós Book 2013 Springer-Verlag Berlin Heidelberg 2013 combinatorics.number theory.pro

scotoma

缺乏

https://doi.org/10.1007/978-3-319-97436-1ntegers and k ≥ 3. By a conjecture, such a product is never a perfect .-th power if . > 3, . ≥2 or . = 3, . > 2. In the classical case . = 1 the conjecture has been proved by Erdős and Selfridge [11]. The general case . ≥ 1 seems to be very hard, then there are only partial results; for survey paper

顾客

鸽子

https://doi.org/10.1007/978-981-15-5936-5not too many essential stories which have determined the course of the subject over a long period, enduring stories which appear again and again as a source of inspiration and motivate and challenge research.

induct

Esophagitis

Reasoning for Resolving Customer Complaints,th a problem of Heinz Hopf and Erika Pannwitz from 1934 and a seminal paper of Paul Erdős from 1946, we give a biased survey of Turán-type questions in the theory of geometric and topological graphs. What is the maximum number of edges that a geometric or topological graph of . vertices can have if

Exuberance

Renier van Heerden,Louise Leenen,Barry Irwin them were either initiated by Paul Erdős (sometimes with coauthors), or were raised ahead of Erdős; nevertheless he was among those who reached very important results in them (like the problem of the large and small gaps between consecutive primes).

赌博

Issa Traore,Isaac Woungang,Sherif SaadThat is, if . denotes the sum of the proper divisors of . (“proper divisor” means . │ . and 1 ≤ . < .), then .When faced with remarkable examples such as this it is natural to wonder how special they are. Through the centuries mathematicians tried to find other examples of amicable pairs, and they d

受伤

genesis

Tankiso Moloi,Tshilidzi MarwalaWe shall review the foundation of the theory of random graphs by Paul Erdős and Alfréd Rényi, and sketch some of the later developments concerning the giant component, including some very recent results.