Author:
DUFFUS DWIGHT,KAY BILL,RÖDL VOJTĚCH
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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference7 articles.
1. On 3-chromatic hypergraphs
2. A note on random greedy coloring of uniform hypergraphs
3. Kronenberg G. , Kusch C. , Micek P. and Tran T. A note on the minimum number of edges in hypergraphs with Property O. arXiv:1703.09767v1
4. On a probabilistic graph-theoretical method
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献