Answers are grounded in this paper and cite their sources.
We analyze a random greedy process to construct q-uniform linear hypergraphs using the differential equation method. We show for q=o(√log n), that this process yields a hypergraph with n(n-1)/q(q-1)(1-o(1)) edges. We also give some bounds for maximal linear hypergraphs.
No takes yet. Share an insight, caveat, or question.
Chakravarty et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: