Pseudo-random hypergraphs (Q1812585): Difference between revisions

An \(r\)-uniform hypergraph \(G\) is said to be \((p,\alpha)\)-jumbled if \(p,\alpha\) are real numbers satisfying \(0<p<1 \leq \alpha\), and if every induced subgraph \(H\) of \(G\) satisfies \(| e(H) - p {| H | \choose r} | \leq \alpha | H |\), where \(e(H)\) is the number of edges in \(H\). Two sufficient conditions for a hypergraph to be \((p,\alpha)\)-jumbled are proved. Then, some of the basic properties of jumbled hypergraphs are established.