Monochromatic components in edge-colored complete uniform hypergraphs

  title={Monochromatic components in edge-colored complete uniform hypergraphs},
  author={Zolt{\'a}n Kir{\'a}ly},
  journal={Electronic Notes in Discrete Mathematics},
Let Kr n denote the complete r-uniform hypergraph on vertex set V = [n]. An f -coloring is a coloring of the edges with colors {1, 2, . . . , f}, it defines monochromatic r-uniform hypergraphs Hi = (V,Ei) for i = 1, . . . , f , where Ei contains the r-tuples colored by i. The connected components of hypergraphs Hi are called monochromatic components. For n > rk let f(n, r, k) denote the maximum number of colors, such that in any f -coloring of Kr n, there exist k monochromatic components… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-7 of 7 references

On special cases of Ryser’s conjecture, manuscript

  • Zs. Tuza
  • EGRES Technical Report No
  • 2011

Haxell Hall ’ s theorem for hypergraphs

  • P. Aharoni
  • J . Graph Theory
  • 2000

Partition coverings and blocking sets in hypergraphs

  • A. Gyárfás
  • Commun. Comput. Autom. Inst. Hungar. Acad. Sci
  • 1977

On minimax theorems of combinatorics

  • L. Lovász
  • Matematikai Lapok
  • 1975

Permutation Decompositions of (0, 1)-matrices and decomposition transversals

  • J. R. Henderson
  • 1971

Kőnig Theorie der endlichen und unendlichen Graphen , Leipzig ( 1936 ) [ 9 ] L . Lovász On minimax theorems of combinatorics

  • C. Song Mansour, R. Yuster
  • Matematikai Lapok

Similar Papers

Loading similar papers…