<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>03857112</id>
  <dt>a</dt>
  <an>03857112</an>
  <augroup>
    <au>Erd\H{o}s, Paul</au>
  </augroup>
  <ti>On some of my conjectures in number theory and combinatorics.</ti>
  <so>Combinatorics, graph theory and computing, Proc. 14th Southeast. Conf., Boca Raton/Flo. 1983, Congr. Numerantium 39, 3-19 (1983).</so>
  <py>1983</py>
  <pu></pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Egyptian fractions</ut>
    <ut>density of graphs</ut>
    <ut>forbidden graphs</ut>
    <ut>Ramsey-Tur\'an problems</ut>
    <ut>divisors of numbers</ut>
  </utgroup>
  <cigroup>
    <ci>Zbl 0523.00001</ci>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>[For the entire collection see Zbl 0523.00001.] A typical Erd\H{o}s report on some of his and not only his problems where a significant progress has been made in the last time. To be more precise, the paper is divided in three sections. The first of them is centered about divisors of numbers, the second one deals with combinatorics (jumping constant conjecture, extremal problems with forbidden or allowed subgraphs, Ramsey-Tur\'an type problems, etc.). The paper ends with a discussion on a geometric problem and some unconventional number theoretical problems on representations of numbers in a rather special form.</ab>
    <rv>S.Porubsky</rv>
  </abgroup>
</item>