Helly-type theorems for the ordering of the vertices of a hypergraph

DOI10.1007/S11083-023-09625-XarXiv2209.14258OpenAlexW4376646280WikidataQ122730735 ScholiaQ122730735MaRDI QIDQ6139863FDOQ6139863

Csaba Biró, Jeno Lehel, Géza Tóth

Publication date: 19 December 2023

Published in: Order (Search for Journal in Brave)

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 {em 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 ($rgeq3$), 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.

Full work available at URL: https://arxiv.org/abs/2209.14258

Recommendations

• Some properties of ordered hypergraphs
• An Edge Ordering Problem of Regular Hypergraphs
• A Ramsey-Type Theorem for Orderings of a Graph
• Helly type theorem and graphs
• Orderings of uniquely colorable hypergraphs
• The order of hypotraceable oriented graphs
• On an ordering problem in weighted hypergraphs
• Erdős-Hajnal-type theorems in hypergraphs
• EXTREMAL THEORY OF ORDERED GRAPHS
• The colorful Helly theorem and general hypergraphs

zbMATH Keywords

uniform hypergraphbetweennesslinear order

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Cites Work

• Johnson graphs are Hamilton-connected
• Title not available (Why is that?)
• A survey of forbidden configuration results
• Betweenness, orders and interval graphs
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• Order types of convex bodies
• Axiomatic theory of betweenness
• Extremal problems for convex geometric hypergraphs and ordered hypergraphs

Cited In (1)

• On an ordering problem in weighted hypergraphs

This page was built for publication: Helly-type theorems for the ordering of the vertices of a hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139863)