|
|||||
|
|
An extremal problem in hypergraph coloring |
|
| Authors: | F Sterboul |
| Institution: | University Paris VI, Paris, France |
| Abstract: | F(n, r, k) is defined to be the minimum number of edges in an r graph on n vertices in which there exists a strongly colored edge in every equipartite k-coloring. Approximate values are given for this function in the general case, and the problem is solved in the particular case of graphs. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |