|
The Erdős–Burr conjecture on Ramsey numbers of graphs. The Erdős–Faber–Lovász conjecture on coloring unions of cliques. The Erdős–Gyárfás conjecture on cycles with lengths equal to a power of two in graphs with minimum degree 3. The Erdős–Hajnal conjecture that in a family of graphs defined by an excluded induced subgraph, every graph has either a large clique or a large independent set. [Ramsey-type theorems, Discrete Applied Mathematics 25 (1989) 37-52] The Erdős–Mollin–Walsh conjecture on consecutive triples of powerful numbers. The Erdős–Selfridge conjecture that a covering set contains at least one odd member. The Erdős–Straus conjecture on the Diophantine equation 4/n = 1/x + 1/y + 1/z. The Erdős conjecture on arithmetic progressions in sequences with divergent sums of reciprocals. The Erdős–Szekeres conjecture on the number of points needed to ensure that a point set contains a large convex polygon. The Erdős–Turán conjecture on additive bases of natural numbers. A conjecture on quickly growing integer sequences with rational reciprocal series. A conjecture with Norman Oler on circle packing in an equilateral triangle with a number of circles one less than a triangular number. The minimum overlap problem to estimate the limit of M(n). Erdős discrepancy problem on partial sums of ±1-sequences. |
About us|Jobs|Help|Disclaimer|Advertising services|Contact us|Sign in|Website map|Search|
GMT+8, 2015-9-11 22:04 , Processed in 0.141935 second(s), 16 queries .
