Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees

DOI10.1137/19M1299876zbMath1453.05066arXiv1802.08918OpenAlexW3103475865MaRDI QIDQ5139656

Linyuan Lu, Zhiyu Wang

Publication date: 10 December 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.08918

zbMATH Keywords

matroidanti-Ramseyrainbow spanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

Anti-Ramsey numbers for cycles in the generalized Petersen graphs, Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-disjoint rainbow spanning trees in complete graphs
• Rainbow generalizations of Ramsey theory: A survey
• The anti-Ramsey number of perfect matching
• Edge-colorings of complete graphs that avoid polychromatic trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• An anti-Ramsey theorem on cycles
• Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees
• Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Spanning trees with many or few colors in edge-colored graphs
• Multicolored trees in complete graphs