The Minimum Number of Edges in Uniform Hypergraphs with Property O
Combinatorics
2016-08-24 v1
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.
Keywords
Cite
@article{arxiv.1608.06621,
title = {The Minimum Number of Edges in Uniform Hypergraphs with Property O},
author = {Dwight Duffus and Bill Kay and Vojtech Rodl},
journal= {arXiv preprint arXiv:1608.06621},
year = {2016}
}
Comments
9 pages, 1 figure