{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:40Z","timestamp":1753893820758,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In their classical paper, Erd\u0151s, Goodman and P\u00f3sa 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.<\/jats:p>","DOI":"10.37236\/12845","type":"journal-article","created":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T11:22:30Z","timestamp":1740655350000},"source":"Crossref","is-referenced-by-count":0,"title":["On Set Representation of Bounded Degree Hypergaphs"],"prefix":"10.37236","volume":"32","author":[{"given":"Ayush","family":"Basu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Griffin","family":"Johnston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo","family":"Sales","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2025,2,28]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i1p27\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i1p27\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T11:22:30Z","timestamp":1740655350000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v32i1p27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,28]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,1,17]]}},"URL":"https:\/\/doi.org\/10.37236\/12845","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2025,2,28]]},"article-number":"P1.27"}}