I. Reiman’s research while affiliated with Budapest Institute and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (1)


Über ein Problem von K. Zarankiewicz
  • Article

September 1958

·

17 Reads

·

175 Citations

Acta Mathematica Academiae Scientiarum Hungaricae

I. Reiman

Citations (1)


... This auxiliary graph will be of girth at least six. Then the authors applies Reiman's inequality [19], [20] to derive an upper bound on the code size. This idea will be refined to get a stronger upper bound in the next section. ...

Reference:

Improved Bounds for Codes over Trees
Über ein Problem von K. Zarankiewicz
  • Citing Article
  • September 1958

Acta Mathematica Academiae Scientiarum Hungaricae