Name
Abstract | ||
|---|---|---|
We show that there exists an absolute constant A such that for each k≥2 and every coloring of the edges of the complete k-uniform hypergraph on Ar vertices with r colors, r≥rk, one of the color classes contains a loose path of length three. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ejc.2018.02.033 | European Journal of Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Vertex (geometry),Hypergraph,Ramsey's theorem,Mathematics | Journal | 71 |
ISSN | Citations | PageRank |
0195-6698 | 0 | 0.34 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Łuczak | 1 | 225 | 40.26 |
| joanna polcyn | 2 | 10 | 5.79 |
| Andrzej Rucinski 0001 | 3 | 197 | 30.44 |