Edge coloring complete uniform hypergraphs with many components

Details Edge coloring complete uniform hypergraphs with many components Edge coloring complete uniform hypergraphs with many components

2002-02-22

arxiv.org/abs/math/0202231v1

Mathematics

Combinatorics

14 pages

Scientific paper

Let $H$ be a hypergraph. For a $k$-edge coloring $c : E(H) \to \{1,...,k\}$ let $f(H,c)$ be the number of components in the subhypergraph induced by the color class with the least number of components. Let $f_k(H)$ be the maximum possible value of $f(H,c)$ ranging over all $k$-edge colorings of $H$. If $H$ is the complete graph $K_n$ then, trivially, $f_1(K_n)=f_2(K_n)=1$. In this paper we prove that for $n \geq 6$, $f_3(K_n)=\lfloor n/6 \rfloor+1$ and supply close upper and lower bounds for $f_k(K_n)$ in case $k \geq 4$. Several results concerning the value of $f_k(K_n^r)$, where $K_n^r$ is the complete $r$-uniform hypergraph on $n$ vertices, are also established.

Affiliated with

Also associated with

No associations

Rating

Edge coloring complete uniform hypergraphs with many components does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Edge coloring complete uniform hypergraphs with many components, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge coloring complete uniform hypergraphs with many components will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-339585