Hypergraphs in which all disjoint pairs have distinct unions
Author:
- 1 June 1984
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 4 (2-3) , 161-168
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A new extremal property of Steiner triple-systemsDiscrete Mathematics, 1984
- A new generalization of the Erdős-Ko-Rado theoremCombinatorica, 1983
- Graphs without quadrilateralsJournal of Combinatorial Theory, Series B, 1983
- Intersection Theorems on Structures1980
- An existence theory for pairwise balanced designs I. Composition theorems and morphismsJournal of Combinatorial Theory, Series A, 1972
- On coloring graphs to maximize the proportion of multicolored k-edgesJournal of Combinatorial Theory, 1968
- On Graphs that do not Contain a Thomsen GraphCanadian Mathematical Bulletin, 1966
- A Balanced Incomplete Block DesignThe Annals of Mathematical Statistics, 1965