In this paper, we use a combinatorial analysis method. In the complete graph K N with edges colored arbitrarily by red or blue, we consider the proposition of the subgraph of the red graph or blue graph induced by t...In this paper, we use a combinatorial analysis method. In the complete graph K N with edges colored arbitrarily by red or blue, we consider the proposition of the subgraph of the red graph or blue graph induced by the neighborhood of some vertex in V(K N). Inspired by the main results of Jayawardene and Rousseau (Ars Combinatoria, 2000, 163-173), we determine the Ramsey numbers of r(K 1, 4, G), where G is the three-partite graph of order six without isolate vertex.展开更多
文摘In this paper, we use a combinatorial analysis method. In the complete graph K N with edges colored arbitrarily by red or blue, we consider the proposition of the subgraph of the red graph or blue graph induced by the neighborhood of some vertex in V(K N). Inspired by the main results of Jayawardene and Rousseau (Ars Combinatoria, 2000, 163-173), we determine the Ramsey numbers of r(K 1, 4, G), where G is the three-partite graph of order six without isolate vertex.
