The Minimum Number of Edges in Uniform Hypergraphs with Property O

DOI10.1017/S096354831700058XzbMath1391.05188arXiv1608.06621OpenAlexW2964266744MaRDI QIDQ3177361

Dwight Duffus, Vojtěch Rödl, Bill Kay

Publication date: 24 July 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.06621

zbMATH Keywords

oriented \(k\)-uniform hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

A note on the minimum number of edges in hypergraphs with property O

Cites Work

• Unnamed Item
• On 3-chromatic hypergraphs
• Coloring n-sets red and blue
• A note on random greedy coloring of uniform hypergraphs
• On a Probabilistic Graph-Theoretical Method
• Improved bounds and algorithms for hypergraph 2-coloring

This page was built for publication: The Minimum Number of Edges in Uniform Hypergraphs with Property O