Note on set representation of bounded degree hypergaphs
Abstract
In their classical paper, Erdos, Goodman and P\'osa studied the representation of a graph with vertex set [n] by a family of subsets S1,…, Sn with the property that \i,j\ is an edge if and only if Si Sj≠ . In this note, we consider a similar representation of bounded degree r-uniform hypergraphs and establish some bounds for a corresponding problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.