𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On testing the ‘pseudo-randomness’ of a hypergraph

✍ Scribed by Julie Haviland; Andrew Thomason

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
405 KB
Volume
103
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Haviland, J. and A. Thomason, On testing the 'pseudo-randomness' of a hypergraph, Discrete Mathematics 103 (1992) 321-327. By Haviland and Thomason (1989) a definition for a pseudo-random hypergraph was proposed, and the resemblance between these pseudo-random hypergraphs and random hypergraphs was explored.

Moreover, a sufficient condition was given for a hypergraph to be pseudo-random according to this definition.

Here we show that a weaker condition suffices, and give a short proof. We also report a number of examples which show that the resemblance of pseudorandom hypergraphs to random hypergraphs is much less marked than the analogous comparison in the case of graphs. The examples are easily verified by means of the theorem presented here.

📜 SIMILAR VOLUMES

The chromatic numbers of random hypergra
The chromatic numbers of random hypergraphs
✍ Michael Krivelevich; Benny Sudakov 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB 👁 1 views

For a pair of integers 1 F ␥r, the ␥-chromatic number of an r-uniform Ž . hypergraph H s V, E is the minimal k, for which there exists a partition of V into subsets < < T, . . . , T such that e l T F ␥ for every e g E. In this paper we determine the asymptotic 1 k i Ž . behavior of the ␥-chromatic n

A Two-Stage Test for Distinguishing Rand
A Two-Stage Test for Distinguishing Random, Pseudo-Random and Nonrandom Mating Populations
✍ Dr. J. J. Tai; Joumiao Liu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 426 KB

## Abstract There is no such an implication that a population in Hardy‐Weinberg equilibrium must have undergone random mating. Therefore, it is unequivocal that the usual tests for “Hardy‐Weinberg equilibrium” are indeed tests for “random union of gametes” but not for “random mating”. In this paper

On the cyclomatic number of a hypergraph
On the cyclomatic number of a hypergraph
✍ B.D. Acharya 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 572 KB

## This note generalizes the notion of cyclomatic number (or cycle rank) from Graph Theory to Hypergraph Theory and links it up with the concept of planarity in hypergraphs which was recently introducea by R.P. Jones. Sharp bounds are obtained for the cyclomatic number of the planar hypergraphs an