• Corpus ID: 238353965

Anti-Ramsey problems in the generalized Petersen graphs for cycles

@inproceedings{Liu2021AntiRamseyPI,
  title={Anti-Ramsey problems in the generalized Petersen graphs for cycles},
  author={Huiqing Liu and Mei Lu and Shunzhe Zhang},
  year={2021}
}
The anti-Ramsey number Ar(G,H) is the maximum number of colors in an edge-coloring of G with no rainbow copy of H. In this paper, we determine the exact anti-Ramsey number in the generalized Petersen graph Pn,k for cycles Cd, where 1 ≤ k ≤ bn−1 2 c and 5 ≤ d ≤ 6. We also give an algorithm to obtain the upper bound or lower bound of anti-Ramsey number. 

References

SHOWING 1-10 OF 21 REFERENCES
An Anti-Ramsey Theorem on Cycles
TLDR
The value of h(n,p) is determinated for n≥p≥3 and as a corollary the equality which was conjectured by Erdös, Simonovits and Sós 30 years ago is obtained.
Bipartite anti‐Ramsey numbers of cycles
We determine the maximum number of colors in a coloring of the edges of Km,n such that every cycle of length 2k contains at least two edges of the same color. One of our main tools is a result on
Anti-Ramsey numbers in complete split graphs
Anti-Ramsey Numbers for Graphs with Independent Cycles
TLDR
The anti-Ramsey number, introduced by Erdős et al., is determined, where $\Omega_2$ denotes the family of graphs that contain two independent cycles.
An Anti-Ramsey Theorem
TLDR
This paper proves that for n and p, the minimum number of colours, such that every -colouring of the edges of which uses all the colours produces at least one all whose edges have different colours, is given by .
Rainbow matchings in edge-colored complete split graphs
Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles and Matchings
TLDR
A complete bipartite graph is considered as the host graph and some results for the graph H being hamiltonian cycle and perfect matching are discussed, including the anti-Ramsey number.
Rainbows in the Hypercube
TLDR
The investigation of this anti-Ramsey problem is started by providing bounds on f(Qn,Qk) which are asymptotically tight for k = 2 and by giving some exact results.
Rainbow Numbers for Cycles in Plane Triangulations
In the article, the existence of rainbow cycles in edge colored plane triangulations is studied. It is shown that the minimum number rb (Tn,C3) of colors that force the existence of a rainbow C3 in
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 Kn not having t edge‐disjoint rainbow spanning subgraphs of specified types. Let c(n,t) , m(n,t) , and r(n,t) denote the
...
...