Skip to main content Accessibility help
×
Home
Hostname: page-component-568f69f84b-5zgkz Total loading time: 0.176 Render date: 2021-09-19T03:43:37.925Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

Extremal problems for convex geometric hypergraphs and ordered hypergraphs

Published online by Cambridge University Press:  10 August 2020

Zoltán Füredi
Affiliation:
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Reáltanoda utca 13–15, H-1053, Budapest, Hungary e-mail: zfuredi@gmail.com
Tao Jiang
Affiliation:
Department of Mathematics, Miami University, Oxford, OH 45056, USA e-mail: jiangt@miamioh.edu
Alexandr Kostochka
Affiliation:
Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA and Sobolev Institute of Mathematics, Novosibirsk 630090, Russia e-mail: kostochk@math.uiuc.edu
Dhruv Mubayi*
Affiliation:
Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL 60607, USA
Jacques Verstraëte
Affiliation:
Department of Mathematics, University of California at San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0112, USA e-mail: jverstra@math.ucsd.edu
*Corresponding

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ı–Károlyi–Valtr, Capoyleas–Pach, and Aronov–Dujmovič–Morin–Ooms-da Silveira. We also provide a new variation of the Erdős-Ko-Rado theorem in the ordered setting.

Type
Article
Copyright
© Canadian Mathematical Society 2020

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Research supported by grant K116769 from the National Research, Development and Innovation Office NKFIH and by the Simons Foundation Collaboration grant #317487. Research partially supported by NSF grants DMS-1400249, DMS-1855542, DMS-1300138, DMS-1763317, and DMS-1556524, as well as DMS-1600592 by Award RB17164 of the UIUC Campus Research Board and by grants 18-01-00353A and 19-01-00682 of the Russian Foundation for Basic Research.

References

Aronov, B., Dujmovič, V., Morin, P., Ooms, A., and da Silveira, L., More Turán-type theorems for triangles in convex point sets . Electron. J. Comb. 26(2019), no. 1, Article Number P1.8.Google Scholar
Braı, P., Turán-type extremal problems for convex geometric hypergraphs . Contemp. Math. 342(2004), 2534.Google Scholar
Braı, P., Károlyi, G., and Valtr, P., A Turán-type extremal theory of convex geometric graphs . In: Goodman-Pollack festschrift, Springer-Verlag, Berlin, Turnhout, 2003, pp. 277302.Google Scholar
Braı, P., Rote, G., and Swanepoel, K., Triangles of extremal area or perimeter in a finite planar point set . Discrete Comput. Geom. 26(2001), 5158.Google Scholar
Capoyleas, V. and Pach, J., A Turán-type theorem for chords of a convex polygon . J. Combin. Theory Ser. B 56(1992), 915.CrossRefGoogle Scholar
Erdős, P. and Hanani, H., On a limit theorem in combinatorial analysis . Publ. Math. Debr. 10(1963), 1013.Google Scholar
Erdős, P. and Kleitman, D., On coloring graphs to maximize the proportion of multicolored k-edges . J. Combin. Theory 5(1968), 164169.CrossRefGoogle Scholar
Füredi, Z., Jiang, T., Kostochka, A., Mubayi, D., and Verstraete, J., Tight paths in convex geometric hypergraphs . Adv. Combinatorics 1(2020), no. 1, 14.Google Scholar
Füredi, Z., Kostochka, A., Mubayi, D., and Verstraete, J., Ordered and convex geometric trees with linear extremal function. Preprint, 2019. https://arxiv.org/abs/1812.05750CrossRefGoogle Scholar
Füredi, Z., Jiang, T., Kostochka, A., Mubayi, D., and Verstraëte, J., Partitioning ordered hypergraphs. J. Combin. Theory Ser. A 177 (2021), 105300.CrossRefGoogle Scholar
Hopf, H. and Pannwitz, E., Aufgabe Nr. 167 . Jahresbericht d. Deutsch Math. Verein. 43(1934), 114.Google Scholar
Korándi, D., Tardos, G., Tomon, I., and Weidert, C., On the Turán number of ordered forests . Electron Notes Discret. Math. 61(2017), 773779.CrossRefGoogle Scholar
Kupitz, Y. S. and Perles, M., Extremal theory for convex matchings in convex geometric graphs . Discrete Comput. Geom. 15(1996), 195220.CrossRefGoogle Scholar
Marcus, A. and Tardos, G., Excluded permutation matrices and the Stanley-Wilf conjecture . J. Combinatorial Theory Ser. A 107(2004), 153160.CrossRefGoogle Scholar
Pach, J. and Tardos, G., Forbidden paths and cycles in ordered graphs and matrices . Israel J. Math. 155(2006), 359380.CrossRefGoogle Scholar
Pach, J. and Pinchasi, R., How many unit equilateral triangles can be generated by $~n~$ points in general position? Am. Math. Mon. 110(2003), 100106.CrossRefGoogle Scholar
Sutherland, J. W., Lösung der Aufgabe 167 . Jahresbericht Deutsch. Math. Verein. 45(1935), 3335.Google Scholar
1
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Extremal problems for convex geometric hypergraphs and ordered hypergraphs
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Extremal problems for convex geometric hypergraphs and ordered hypergraphs
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Extremal problems for convex geometric hypergraphs and ordered hypergraphs
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *