Abstract
Let H be a complete r-uniform hypergraph such that two vertices are marked in each edge as its ‘boundary’ vertices. A linear ordering of the vertex set of H is called an agreeing linear order, provided all vertices of each edge of H lie between its two boundary vertices. We prove the following Helly-type theorem: if there is an agreeing linear order on the vertex set of every subhypergraph of H with at most 2r − 2 vertices, then there is an agreeing linear order on the vertex set of H. We also show that the constant 2r − 2 cannot be reduced in the theorem. The case r = 3 of the theorem has particular interest in the axiomatic theory of betweenness. Similar results are obtained for further r-uniform hypergraphs (r ≥ 3), where one or two vertices are marked in each edge, and the linear orders need to satisfy various rules of agreement. In one of the cases we prove that no such Helly-type statement holds.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Data Availability
No data was used in this research.
References
Alspach, B.: Johnson graphs are Hamilton-connected. Ars Math. Contemp. 6(1), 21–23 (2013)
Anstee, R. P.: A Survey of Forbidden Configuration Results. In: Dynamic Surveys, Electron. J. Comb (2013)
Azimipour, S., Naumov, P.: Axiomatic theory of betweenness. arXiv:1902.00847v2 (2020)
Biró, C., Lehel, J., Tóth, G.: Betweenness of convex bodies in the plane. In: Preparation (2023)
Fishburn, P.C.: Betweenness orders and interval graphs. J. Pure Appl. Algebra 1(2), 159–178 (1971)
Fishburn, P.C.: Interval orders and interval graphs. A study of partially ordered sets. Wiley-Interscience Series in Discrete Mathematics. A Wiley-Interscience Publication, p xi+ 215. Wiley, Chichester (1985)
Fox, J., Pach, J., Sudakov, B., Suk, A.: Erdős-szekeres-type theorems for monotone paths and convex bodies. Proc. London Math. Soc. 105, 953–982 (2012)
Füredi, Z., Tao, J., Kostochka, A., Mubayi, D., Verstraëte, J.: Extremal problems for convex geometric hypergraphs and ordered hypergraphs. Can. J. Math. 73(6), 1648–1666 (2021)
Hubard, A., Montejano, L., Mora, E., Suk, A.: Order types of convex bodies. Order 28, 121–130 (2011)
Huntington, E. V.: A new set of postulates for betweenness, with proof of complete independence. Trans. Amer. Math. Soc. 26(2), 257–282 (1924)
Huntington, E.V., Kline, J.R.: Sets of independent postulates for betweenness. Trans. Amer. Math. Soc. 18(3), 301–325 (1917)
Funding
Open access funding provided by ELKH Alfréd Rényi Institute of Mathematics. Géza Tóth was supported by National Research, Development and Innovation Office, NKFIH, K-131529 and ERC Advanced Grant “GeoScape,” No. 882971.
Csaba Biró and Jenő Lehel did not receive funding.
Author information
Authors and Affiliations
Contributions
As it is customary for mathematical publications, the authors wish not to disclose the details of participation, and each author will receive equal credit.
Corresponding author
Ethics declarations
Conflict of Interests
We declare that the authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and/or discussion reported in this paper.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Biró, C., Lehel, J. & Tóth, G. Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph. Order 40, 665–682 (2023). https://doi.org/10.1007/s11083-023-09625-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-023-09625-x