Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees
Explore this paper's citation graph
Summary
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.
- Type
- article
- Published
- 2020-11-12
- Cited by
- 4
- References
- 19
- OpenAlex
- https://openalex.org/W3103304230
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:228861704
Keywords
Combinatorics, Bipartite graph, Mathematics, Rainbow, Disjoint sets
References
- Anti-Ramsey Numbers for Graphs with Independent Cycles
- Bipartite rainbow numbers of matchings
- The anti-Ramsey number of perfect matching
- An Anti-Ramsey Theorem on Cycles
- Rainbow Generalizations of Ramsey Theory: A Survey
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Complete solution for the rainbow numbers of matchings
- Edge-disjoint spanning trees of finite graphs
- On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems
- An Anti-Ramsey Theorem
- Anti‐Ramsey Problems for t Edge‐Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees
- Edge-colorings of complete bipartite graphs without large rainbow trees
- Bipartite anti‐Ramsey numbers of cycles
- Rainbow number of matchings in regular bipartite graphs
- Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles and Matchings
- The rainbow number of matchings in regular bipartite graphs
- Bipartite anti-Ramsey numbers of cycles
Cited by
Related papers
- Rainbow matchings in bipartite multigraphs
- A rainbow matching in a bipartite graph
- Rainbow spanning trees in complete graphs colored by one‐factorizations
- On the number of rainbow spanning trees in edge-colored complete graphs
- Edge-disjoint rainbow spanning trees in complete graphs
- An Exact Algorithm for Finding K-Biclique Vertex Partitions of Bipartites
- The Biclique Cover Problem and the Modified Galois Lattice