| Presentation | 2004-06-25 Partitions, Functions and Line digraphs Hiroyuki KAWAI, Yukio SHIBATA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Let f and g be two maps from a set E into a set F such that f(x)≠g(x) for all x in E. Sahili[7] has shown that the relationship obtained from the maps and the sets is represented by a digraph and its line digraph. It was shown that for any element z∈F_1, if either f^<-1>(z) or g^<-1>(z) has at most n elements, then E can be partitioned into subsets E_1,E_2,...,E_<2n+1> such that f(E_i)∩g(E_i)=0, 1≦i≦2n+1 Sahili[7] also posed a question: Is 2n+1 the best possible bound?In this report, we answer this problem, that is, we improve 2n+1 to min[numerical formula] using the result of an arc-coloring of digraphs. We also investigate extended version to three maps. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | partition / arc-coloring / line digraph |
| Paper # | COMP2004-18 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2004/6/18(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Partitions, Functions and Line digraphs |
| Sub Title (in English) | |
| Keyword(1) | partition |
| Keyword(2) | arc-coloring |
| Keyword(3) | line digraph |
| 1st Author's Name | Hiroyuki KAWAI |
| 1st Author's Affiliation | Satellite Venture Business Laboratory, Gunma University() |
| 2nd Author's Name | Yukio SHIBATA |
| 2nd Author's Affiliation | Department of Computer Science, Gunma University |
| Date | 2004-06-25 |
| Paper # | COMP2004-18 |
| Volume (vol) | vol.104 |
| Number (no) | 147 |
| Page | pp.pp.- |
| #Pages | 3 |
| Date of Issue | |