Note on set representation of bounded degree hypergaphs
classification
🧮 math.CO
keywords
representationboundeddegreenoteboundsclassicalconsidercorresponding
read the original abstract
In their classical paper, Erd\H{o}s, Goodman and P\'{o}sa studied the representation of a graph with vertex set $[n]$ by a family of subsets $S_1,\dots, S_n$ with the property that $\{i,j\}$ is an edge if and only if $S_i\cap S_j\neq \emptyset$. In this note, we consider a similar representation of bounded degree $r$-uniform hypergraphs and establish some bounds for a corresponding problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.