The Minimum Number of Edges in Uniform Hypergraphs with Property O

2016/08/23 by Duffus, Dwight, Kay, Bill, Rodl, Vojtech · 1 citation
#05C65 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1608.06621

Abstract

An oriented k-uniform hypergraph (a family of ordered k-sets) has the ordering property (or Property O) if for every linear order of the vertex set, there is some edge oriented consistently with the linear order. We find bounds on the minimum number of edges in a hypergraph with Property O.

Cited by

• Property O and Erdős--Szekeres properties in linear hypergraphs

Related

• Property O and Erdős--Szekeres properties in linear hypergraphs
• On some generalizations of the property B-problem of an n-uniform hypergraph
• Sparse hypergraphs: new bounds and constructions
• Degrees giving independent edges in a hypergraph
• Extremal problems on ordered and convex geometric hypergraphs