Simple hypergraphs with maximal number of adjacent pairs of edges

Ahlswede, Rudolf

Simple hypergraphs with maximal number of adjacent pairs of edges

Ahlswede R (1980)
Journal of Combinatorial Theory, Series B 28(2): 164-167.

Zeitschriftenaufsatz | Veröffentlicht | Englisch

Download

Ahlswede_37.pdf

DOI

https://doi.org/10.1016/0095-8956(80)90062-3

URN

urn:nbn:de:0070-pub-17804005

Autor*in

Ahlswede, Rudolf^UniBi

Einrichtung

Fakultät für Mathematik

Erscheinungsjahr

1980

Zeitschriftentitel

Journal of Combinatorial Theory, Series B

Band

28

Ausgabe

2

Seite(n)

164-167

ISSN

0095-8956

Page URI

https://pub.uni-bielefeld.de/record/1780400

Zitieren

Ahlswede R. Simple hypergraphs with maximal number of adjacent pairs of edges. Journal of Combinatorial Theory, Series B. 1980;28(2):164-167.

Ahlswede, R. (1980). Simple hypergraphs with maximal number of adjacent pairs of edges. Journal of Combinatorial Theory, Series B, 28(2), 164-167. https://doi.org/10.1016/0095-8956(80)90062-3

Ahlswede, Rudolf. 1980. “Simple hypergraphs with maximal number of adjacent pairs of edges”. Journal of Combinatorial Theory, Series B 28 (2): 164-167.

Ahlswede, R. (1980). Simple hypergraphs with maximal number of adjacent pairs of edges. Journal of Combinatorial Theory, Series B 28, 164-167.

Ahlswede, R., 1980. Simple hypergraphs with maximal number of adjacent pairs of edges. Journal of Combinatorial Theory, Series B, 28(2), p 164-167.

R. Ahlswede, “Simple hypergraphs with maximal number of adjacent pairs of edges”, Journal of Combinatorial Theory, Series B, vol. 28, 1980, pp. 164-167.

Ahlswede, R.: Simple hypergraphs with maximal number of adjacent pairs of edges. Journal of Combinatorial Theory, Series B. 28, 164-167 (1980).

Ahlswede, Rudolf. “Simple hypergraphs with maximal number of adjacent pairs of edges”. Journal of Combinatorial Theory, Series B 28.2 (1980): 164-167.

Alle Dateien verfügbar unter der/den folgenden Lizenz(en):

Copyright Statement: