On hypergraphs having evenly distributed subhypergraphs
A family of \(k\)-uniform hypergraphs of order \(n\) has property \(U(r)\) for \(r\) fixed if every \(k\)-uniform hypergraph of order \(r\) occurs as an induced subgraph about \(n^ r/2^{{r\choose k}}\) times asymptotically as \(n\to \infty\). It was known that \(U(2k)\) implies \(U(r)\) for all fixed \(r\). Now the authors have shown that this is best possible by constructing for each \(s\), \(1\leq s\leq 2k-1\), families for which \(U(s)\) does not imply \(U(s+1)\). Thus, the remarkable phenomenon that occurs for graphs \((k=2)\) also manifests itself for hypergraphs. There are a couple of misprints in the definition. Interchange \(E\) and \(E'\) on line 7, and in equation (1), the binomial coefficient should be \(r\) above \(k\).
- scientific article; zbMATH DE number 2107118
- On substructure densities of hypergraphs
- scientific article; zbMATH DE number 3307332
- scientific article; zbMATH DE number 701118
- Nearly uniform distribution of edges amongk-subgraphs of a graph
- Subgraphs in non-uniform random hypergraphs
- Equicovering subgraphs of graphs and hypergraphs
- The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs
- On even-degree subgraphs of linear hypergraphs
- On even-cycle-free subgraphs of the hypercube
This page was built for publication: On hypergraphs having evenly distributed subhypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686453)
