| 研究生: |
楊瑞章 |
|---|---|
| 論文名稱: |
Gap in (l,m)-uniform mixed hypergraph |
| 指導教授: | 張宜武 |
| 學位類別: |
碩士
Master |
| 系所名稱: |
理學院 - 應用數學系 Department of Mathematical Sciences |
| 論文出版年: | 2003 |
| 畢業學年度: | 91 |
| 語文別: | 中文 |
| 論文頁數: | 38 |
| 外文關鍵詞: | (l,m)-uniform |
| 相關次數: | 點閱:186 下載:15 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
(l,m)-uniform混和超級圖的色譜一定是是連續的, 利用一個技巧讓所有l大於二的(l,m)-uniform混和超級圖都存在一組C-edges 和 D-edges, 使得光譜不連續.最後提供一個演算法, 讓所有l和m 都大於二的(l,m)-uniform混和超級圖, 也存在一組 C-edges 和 D-edges, 使得光譜不連續. 這樣我們就已經討論完所有(l,m)-uniform混和超級圖( l , m 都要大於等於 2), 其光譜是否存在著有不連續的可能.
In this thesis, we study all existences of gap in every kind of (l,m)-uniform mixed hypergraph, where n > 1 and m > 1. We have to divide the topic into three parts: (2,m)-uniform mixed hypergraph where m > 1, (l,2)-uniform mixed hypergraph
where l > 2, and (l,m)-uniform mixed hypergraph where l > 2 and m > 2.
1 Introduction..............................................1
2 Coloring of a specific mixed hypergraph...................6
3 The situation of gap in special case.....................10
4 Algorithm of gap in $(l,m)$-uniform mixed hypergraph.....19
5 Appendix 1...............................................31
6 Appendix 2...............................................33
References.................................................35
1 T. Etzion and A. Hartman, Towards a large set of Steiner auaadruple systems, SIAM J. Discrete Math.4.(1991),182-195.
2 T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin, D. West. The Chromatic Spectrum of Mixed Hypergraphs..Graphs and Combinatorics, 18(2002), 309-318.
3 H. Lefmann, V. Rodl, and R. Thomas, Monochromatic vs. multicolored paths, Graphs Combin.8.(1992), 323-332.
4 D. Lozovanu and V. Voloshin, Integer programming and mixed hypergraphs,(in preparation).
5 L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le MathematicheL(Catania, 1995), 179-193.
6 L. Milazzo, The monochromatic block number, Discrete Math. 165-166 (1997), 487-496
7 L. Milazzo and Zs. Tuza, Upper chromatic number of Steiner triple and quadruple systems, Discrete Math. 174(1997),247-259.
8 L. Milazzo and Zs. Tuza, Strict colorings for classes of Steiner triple systems, Discrete Math.182(1998),233-243.
9 Zs. Tuza and V. Voloshin, Uncolorable mixed hypergraphs, Distrete Applied Math.,(to appear)
10 V.Vplosin, Mixed hypergraphs as models for real problems(in preparation).
11 V. Voloshin, On the upper chromatic number of a hypergraph, Australasian J. Comb. 11(1995), 25-45.