Loading...
Please wait, while we are loading the content...
Similar Documents
Extremal problems for convex geometric hypergraphs and ordered hypergraphs.
| Content Provider | Semantic Scholar |
|---|---|
| Author | Furedi, Zolt'an Jiang, Tao Kostochka, Alexandr V. Mubayi, Dhruv Verstraete, Jacques |
| Copyright Year | 2019 |
| Abstract | An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich history with applications to a variety of problems in combinatorial geometry. In this paper, we consider analogous extremal problems for uniform hypergraphs, and determine the order of magnitude of the extremal function for various ordered and convex geometric paths and matchings. Our results generalize earlier works of Bra{\ss}-Karolyi-Valtr, Capoyleas-Pach and Aronov-Dujmovic-Morin-Ooms-da Silveira. We also provide a new generalization of the Erd\H os-Ko-Rado theorem in the ordered setting. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://arxiv.org/pdf/1906.04575v1.pdf |
| Alternate Webpage(s) | http://homepages.math.uic.edu/~mubayi/papers/CGHcrossArXiv.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
