Skip to main content
SpringerLink
Log in

Graphs with maximal number of adjacent pairs of edges

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Moshe Katz, Rearrangements of (0–1) matrices,Israel J. Math.,9 (1971). 53–72.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bielefeld

    R. Ahlswede

  2. Mathematical Institute of the Hungarian Academy of Sciences, Reáltanoda U. 13-15, 1053, Budapest

    G. O. H. Katona

Authors
  1. R. Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. O. H. Katona
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research of this author was supported by the Deutsche Forschungsgemeinschaft.

This work was done while the author visited the Institute of Mathematical Statistics, University of Göttingen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ahlswede, R., Katona, G.O.H. Graphs with maximal number of adjacent pairs of edges. Acta Mathematica Academiae Scientiarum Hungaricae 32, 97–120 (1978). https://doi.org/10.1007/BF01902206

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01902206

Keywords

Search

Navigation