Simple hypergraphs with maximal number of adjacent pairs of edges

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

Download
OA
Journal Article | Published | English
Publishing Year
ISSN
PUB-ID

Cite this

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.
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.
Main File(s)
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar