Skip to main content

The Minimum Number of Edges in Uniform Hypergraphs with Property O


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.

Hide All
[1] Beck, J. (1978) On 3-chromatic hypergraphs. Discrete Math. 24 127137.
[2] Cherkashin, D. D. and Kozik, J. (2015) A note on random greedy coloring of uniform hypergraphs. Random Struct. Alg. 47 407413.
[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] Nešetřil, J. and Rödl, V. (1975) Partitions of subgraphs. In Recent Advances in Graph Theory, Academia, pp. 413423.
[5] Nešetřil, J. and Rödl, V. (1978) On a probabilistic graph-theoretical method. Proc. Amer. Math. Soc. 72 417421.
[6] Radhakrishnan, J. and Srinivasan, A. (2000) Improved bounds and algorithms for hypergraph 2-coloring. Random Struct. Alg. 16 432.
[7] Spencer, J. H. (1981) Coloring n-sets red and blue. J. Combin. Theory Ser. A 30 112113.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

MSC classification


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed