Note on set representation of bounded degree hypergaphs
Combinatorics
2024-12-30 v2
Abstract
In their classical paper, Erd\H{o}s, Goodman and P\'{o}sa studied the representation of a graph with vertex set by a family of subsets with the property that is an edge if and only if . In this note, we consider a similar representation of bounded degree -uniform hypergraphs and establish some bounds for a corresponding problem.
Keywords
Cite
@article{arxiv.2402.16984,
title = {Note on set representation of bounded degree hypergaphs},
author = {Ayush Basu and Griffin Johnston and Vojtěch Rödl and Marcelo Sales},
journal= {arXiv preprint arXiv:2402.16984},
year = {2024}
}
Comments
Revisions from referee report