Loading...
Please wait, while we are loading the content...
Similar Documents
The Erdos-Szekeres problem and an induced Ramsey question
| Content Provider | Semantic Scholar |
|---|---|
| Author | Mubayi, Dhruv Suk, Andrew |
| Copyright Year | 2018 |
| Abstract | Motivated by the Erdos-Szekeres convex polytope conjecture in $R^d$, we initiate the study of the following induced Ramsey problem for hypergraphs. Given integers $ n > k \geq 5$, what is the minimum integer $g_k(n)$ such that any $k$-uniform hypergraph on $g_k(n)$ vertices with the property that any set of $k + 1$ vertices induces 0, 2, or 4 edges, contains an independent set of size $n$. Our main result shows that $g_k(n) > 2^{cn^{k-4}}$, where $c = c(k)$. |
| Starting Page | 702 |
| Ending Page | 707 |
| Page Count | 6 |
| File Format | PDF HTM / HTML |
| DOI | 10.1112/s0025579319000135 |
| Alternate Webpage(s) | https://arxiv.org/pdf/1808.00453v1.pdf |
| Alternate Webpage(s) | http://homepages.math.uic.edu/~mubayi/papers/ESinduced_011219.pdf |
| Alternate Webpage(s) | http://www.math.ucsd.edu/~asuk/ESinduced_072818v2.pdf |
| Alternate Webpage(s) | https://doi.org/10.1112/s0025579319000135 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
