Name
Abstract | ||
|---|---|---|
Chen and Chvátal introduced the notion of lines in hypergraphs; they proved that every 3-uniform hypergraph with n vertices either has a line that consists of all n vertices or else has at least log2n distinct lines. We improve this lower bound by a factor of 2−o(1). |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.dam.2014.02.008 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Finite metric spaces,Lines in hypergraphs,De Bruijn–Erdős theorem,Extremal combinatorics | Discrete mathematics,Combinatorics,Vertex (geometry),Upper and lower bounds,Constraint graph,Hypergraph,Extremal combinatorics,Mathematics | Journal |
Volume | ISSN | Citations |
171 | 0166-218X | 4 |
PageRank | References | Authors |
0.60 | 4 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre Aboulker | 1 | 4 | 0.60 |
| John Adrian Bondy | 2 | 4 | 0.60 |
| Xiaomin Chen | 3 | 7 | 1.43 |
| Ehsan Chiniforooshan | 4 | 118 | 16.38 |
| Vasek Chvátal | 5 | 362 | 43.90 |
| Peihan Miao | 6 | 4 | 0.60 |