The Linear $q$-Hypergraph Process
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915066474921984 |
|---|---|
| author | Chakravarty, Sayok Spanier, Nicholas |
| author_facet | Chakravarty, Sayok Spanier, Nicholas |
| contents | We analyze a random greedy process to construct $q$-uniform linear hypergraphs using the differential equation method. We show for $q=o(\sqrt{\log n})$, that this process yields a hypergraph with $\frac{n(n-1)}{q(q-1)}(1-o(1))$ edges. We also give some bounds for maximal linear hypergraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_01452 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Linear $q$-Hypergraph Process Chakravarty, Sayok Spanier, Nicholas Combinatorics We analyze a random greedy process to construct $q$-uniform linear hypergraphs using the differential equation method. We show for $q=o(\sqrt{\log n})$, that this process yields a hypergraph with $\frac{n(n-1)}{q(q-1)}(1-o(1))$ edges. We also give some bounds for maximal linear hypergraphs. |
| title | The Linear $q$-Hypergraph Process |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2404.01452 |