Note on set representation of bounded degree hypergaphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913625447333888 |
|---|---|
| author | Basu, Ayush Johnston, Griffin Rödl, Vojtěch Sales, Marcelo |
| author_facet | Basu, Ayush Johnston, Griffin Rödl, Vojtěch Sales, Marcelo |
| contents | In their classical paper, Erdős, Goodman and Pó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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_16984 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Note on set representation of bounded degree hypergaphs Basu, Ayush Johnston, Griffin Rödl, Vojtěch Sales, Marcelo Combinatorics In their classical paper, Erdős, Goodman and Pó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. |
| title | Note on set representation of bounded degree hypergaphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2402.16984 |