Name
Abstract | ||
|---|---|---|
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))( k n ) edges as n → ∞. We prove that ρ k = 1 − 2logk/k + Θ(log log k/k) as k → ∞. This disproves a conjecture of Füredi and the last two authors. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s00493-010-2474-6 | Combinatorica |
Keywords | Field | DocType |
largest number,independent neighborhood,n vertex,log log k,k n,k-uniform hypergraphs | Log-log plot,Discrete mathematics,Combinatorics,Vertex (geometry),Constraint graph,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 3 | 0209-9683 |
Citations | PageRank | References |
4 | 0.86 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |
| Alan M. Frieze | 2 | 4837 | 787.00 |
| Dhruv Mubayi | 3 | 579 | 73.95 |
| Oleg Pikhurko | 4 | 318 | 47.03 |