Corpus ID: 236469351

Anti-Ramsey numbers for trees in complete multi-partite graphs

@inproceedings{Zhang2021AntiRamseyNF,
  title={Anti-Ramsey numbers for trees in complete multi-partite graphs},
  author={Meiqiao Zhang and Feng Ming Dong},
  year={2021}
}
Let G be a complete multi-partite graph of order n. In this paper, we consider the antiRamsey number ar(G, Tq) with respect to G and the set Tq of trees with q edges, where 2 ≤ q ≤ n− 1. For the case q = n− 1, the result has been obtained by Lu, Meier and Wang. We will extend it to q < n− 1. We first show that ar(G, Tq) = lq(G) + 1, where lq(G) is the maximum size of a disconnected spanning subgraph H of G with the property that any two components of H together have at most q vertices. Using… Expand

Figures from this paper

References

SHOWING 1-10 OF 16 REFERENCES
Anti-Ramsey Numbers in Complete k-Partite Graphs
+e anti-Ramsey number AR(G, H) is the maximum number of colors in an edge-coloring of G such that G contains no rainbow subgraphs isomorphic to H. In this paper, we discuss the anti-Ramsey numbersExpand
Edge-colorings of complete graphs that avoid polychromatic trees
Given a positive integer n and a family F of graphs, let R^*(n,F) denote the maximum number of colors in an edge-coloring of K"n such that no subgraph of K"n belonging to F has distinct colors on itsExpand
On the anti-Ramsey numbers of linear forests
TLDR
The exact value of anti-Ramsey numbers of linear forests for sufficiently large forests for adequately large graphs is determined, and the extremal edge-colored graphs are shown. Expand
Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees
We seek the maximum number of colors in an edge-coloring of the complete graph not having t edge-disjoint rainbow spanning subgraphs of specified types. Let , , and denote the answers when theExpand
Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees
TLDR
It is proved that the maximum number of colors in an edge-coloring of the complete bipartite graph not having t edge-disjoint rainbow spanning trees is p-2-2p-2 p and r(K_{p,p),1)=pq-2q+1. Expand
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees
TLDR
The anti-Ramsey number of edge-disjoint rainbow spanning trees, denoted by r(n,t)$, is defined as t/(n, t) + 1, where n is the number of trees and t is the total number of particles in the graph. Expand
Rainbow Generalizations of Ramsey Theory - A Dynamic Survey
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs. Revision History • Revision 3: March, 2015. • Revision 2: October, 2014. • Revision 1: July, 2011. •Expand
Tur\'an numbers and anti-Ramsey numbers for short cycles in complete $3$-partite graphs.
We call a $4$-cycle in $K_{n_{1}, n_{2}, n_{3}}$ multipartite, denoted by $C_{4}^{\text{multi}}$, if it contains at least one vertex in each part of $K_{n_{1}, n_{2}, n_{3}}$. The Tur\'an numberExpand
Infinite and Finite Sets
Infinite sets can behave more strangely than finite ones, at least from the perspective of human beings, whose daily experience is of the finite. The difficulty of dealing with infinite sets wasExpand
The anti-Ramsey number for paths
  • arXiv:2102.00807
  • 2021
...
1
2
...