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

DOI10.1007/s11083-023-09625-xarXiv2209.14258OpenAlexW4376646280WikidataQ122730735 ScholiaQ122730735MaRDI QIDQ6139863

Csaba Biró, Jenő Lehel, Géza Tóth

Publication date: 19 December 2023

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

uniform hypergraphbetweennesslinear order

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Order types of convex bodies
• A survey of forbidden configuration results
• Axiomatic theory of betweenness
• Betweenness, orders and interval graphs
• Johnson graphs are Hamilton-connected
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• Extremal problems for convex geometric hypergraphs and ordered hypergraphs

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