Anti-Ramsey problems in complete bipartite graphs for t edge-disjoint rainbow spanning trees

DOI10.1007/S00373-020-02250-0MaRDI QIDQ2657096zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 17 March 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-020-02250-0

zbMATH Keywords

anti-Ramsey problemcomplete bipartite graphrainbowspanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Recommendations

• Anti-Ramsey problems in complete bipartite graphs for t edge-disjoint rainbow spanning subgraphs: cycles and matchings
• Anti-Ramsey problems for t edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
• Anti-Ramsey number of edge-disjoint rainbow spanning trees
• Anti-Ramsey numbers in complete k-partite graphs

Cites work

• An anti-Ramsey theorem
• An anti-Ramsey theorem on cycles
• Anti-Ramsey numbers for graphs with independent cycles
• Anti-Ramsey problems for t edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
• Anti-Ramsey problems in complete bipartite graphs for t edge-disjoint rainbow spanning subgraphs: cycles and matchings
• Bipartite anti-Ramsey numbers of cycles
• Bipartite rainbow numbers of matchings
• Complete solution for the rainbow numbers of matchings
• Edge-colorings of complete bipartite graphs without large rainbow trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• New lower bounds for matching numbers of general and bipartite graphs
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
• On the anti-Ramsey numbers for spanning trees
• On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
• Rainbow generalizations of Ramsey theory: A survey
• The anti-Ramsey number of perfect matching
• The rainbow number of matchings in regular bipartite graphs

Cited in

(8)

• Anti-Ramsey number of matchings in a hypergraph
• Anti-Ramsey problems in complete bipartite graphs for t edge-disjoint rainbow spanning subgraphs: cycles and matchings
• Anti-Ramsey numbers for trees in complete multi-partite graphs
• Anti-Ramsey problems for t edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
• Anti-Ramsey theory on complete bipartite graphs
• Anti-Ramsey number of edge-disjoint rainbow spanning trees
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
• Anti-Ramsey number of matchings in outerplanar graphs

This page was built for publication: Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657096)