共 27 条
- [22] Vertex-distinguishing IE-total Coloring of K4,4,p(p≥1008) Chen, Xiang'en (chenxe@nwnu.edu.cn), 1600, Science Press (42):
- [23] EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K-2,K-n KOREAN JOURNAL OF MATHEMATICS, 2012, 20 (04): : 403 - 414
- [26] yA fundamental result of Extremal Graph Theory is the Hajnal Szemeredi theorem, which states that if k divides n then any graph G on n vertices with minimum degree 8(G) > (k 1)n/k contains a perfect Kk-packing, i.e. a spanning collection of vertexdisjoint k-cliques. This paper considers a conjecture of Fischer [4] on a multipartite analogue of this theorem. Suppose V1,., Vk are disjoint sets of n vertices each, and G is a k-partite graph on vertex classes V1, Vk (that is, G is a graph on the vertex set U " " U Vk such that no edge of G has both endvertices in the same 17j). We define the A multipartite Hajnal-Szemeredi theorem JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 114 : 187 - 236