The Linear q-Hypergraph Process
Abstract
We analyze a random greedy process to construct q-uniform linear hypergraphs using the differential equation method. We show for q=o( 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.