On testing the `pseudo-randomness' of a hypergraph
From authors' abstract: In 1989, by the authors a definition for a pseudo-random hypergraph was proposed. 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 pseudo-random 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.
- Dense expanders and pseudo-random bipartite graphs
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- Imbalances in k‐colorations
- On universality of graphs with uniformly distributed edges
- Pseudo-random hypergraphs
- Quasi-random graphs
- Quasi-random hypergraphs
- Some Ramsey-Turán type results for hypergraphs
- Hypergraphs, quasi-randomness, and conditions for regularity
- Pseudo-random hypergraphs
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Random hypergraphs in pseudofinite fields
- Cycle type in Hall-Paige: a proof of the Friedlander-Gordon-Tannenbaum conjecture
This page was built for publication: On testing the `pseudo-randomness' of a hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195483)
