Quasi‐random classes of hypergraphs
- 1 December 1990
- journal article
- Published by Wiley in Random Structures & Algorithms
- Vol. 1 (4) , 363-382
- https://doi.org/10.1002/rsa.3240010401
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Quasi-random graphsCombinatorica, 1989
- Pseudo-random hypergraphsDiscrete Mathematics, 1989
- Explicit construction of linear sized tolerant networksDiscrete Mathematics, 1988
- Expanders, randomness, or time versus spaceJournal of Computer and System Sciences, 1988
- On universality of graphs with uniformly distributed edgesDiscrete Mathematics, 1986
- Sorting inc logn parallel stepsCombinatorica, 1983
- On Ramsey—Turán type theorems for hypergraphsCombinatorica, 1982
- Cyclotomy and difference families in elementary abelian groupsJournal of Number Theory, 1972
- A Constructive Solution to a Tournament ProblemCanadian Mathematical Bulletin, 1971
- Imbalances in k‐colorationsNetworks, 1971