• Corpus ID: 252567877

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

@inproceedings{Biro2022HellytypeTF,
title={Helly-type theorems for the ordering of the vertices of a hypergraph},
author={Csaba Bir'o and JenHo Lehel and G'eza T'oth},
year={2022}
}
• Published 28 September 2022
• Mathematics
. 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 2 r − 2 vertices, then there is an agreeing linear order on the vertex set of H . We…

## References

SHOWING 1-10 OF 10 REFERENCES

• Mathematics
• 1917
The " universe of discourse " of the present paper is the class of all welldefined systems (K, R) where K is any class of elements A, B, C, ..., and R is any triadic relation. The notation R [ABC],
Let $F$ be a $k\times \ell$ (0,1)-matrix. We say a (0,1)-matrix $A$ has $F$ as a configuration if there is a submatrix of $A$ which is a row and column permutation of $F$. In the language of sets, a
• Mathematics
Order
• 2011
A Hadwiger transversal-type result is proved, characterizing convex position on a family of non-crossing convex bodies in the plane, and a definition for the order type is suggested, generalizing the usual definition of order type for point sets.
It is proved that the Johnson graphs are Hamilton-connected and the result is applied to obtain that another family of graphs is Hamilton- connected.
• P. Thibault
• Distributed Languaging, Affective Dynamics, and the Human Ecology Volume II
• 2020
in which the number of postulates is reduced to five. Moreover, the new postulate 9 itself is easier to remember and more convenient to handle than any of the other postulates 1-8. The addition of
• Mathematics