2000 character limit reached
Note on set representation of bounded degree hypergaphs
Published 26 Feb 2024 in math.CO | (2402.16984v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.