Article contents
The Minimum Number of Edges in Uniform Hypergraphs with Property O
Published online by Cambridge University Press: 19 December 2017
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.
MSC classification
- Type
- Paper
- Information
- Combinatorics, Probability and Computing , Volume 27 , Special Issue 4: Special Issue: Oberwolfach Workshop , July 2018 , pp. 531 - 538
- Copyright
- Copyright © Cambridge University Press 2017
References
- 1
- Cited by