On the order of intersecting hypergraphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917979229257728 |
|---|---|
| author | Cambie, Stijn Kim, Jaehoon Lee, Hyunwoo Liu, Hong Tran, Tuan |
| author_facet | Cambie, Stijn Kim, Jaehoon Lee, Hyunwoo Liu, Hong Tran, Tuan |
| contents | Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems concerning the maximum order of such hypergraphs. In this paper, we systematically study these vertex analogues. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_05162 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the order of intersecting hypergraphs Cambie, Stijn Kim, Jaehoon Lee, Hyunwoo Liu, Hong Tran, Tuan Combinatorics Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems concerning the maximum order of such hypergraphs. In this paper, we systematically study these vertex analogues. |
| title | On the order of intersecting hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2504.05162 |