Hypergraphs with independent neighborhoods

For each k 2, let k (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (k + o(1)) n k edges as n . We prove that k = 1 - 2 log k/k + (log log k/k) as k . This disproves a conjecture of F

• Type: Journal
• Year: 2010
• Where: COMBINATORICA
• Authors: Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko
• Keywords: COMBINATORICA 2010, Independent Neighborhoods, K-uniform Hypergraphs, Largest Number, Machine Learning