Finding large rainbow trees in colourings of \(K_{n, n}\)

DOI10.37236/10976MaRDI QIDQ6117247

Julian Matthes

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

rainbowedge-colouring

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex coverings by monochromatic cycles and trees
• A dynamic survey of graph labeling
• Embedding rainbow trees with applications to graph labelling and decomposition
• A proof of Ringel's conjecture
• Optimal packings of bounded degree trees
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Triangle Factors in Random Graphs

This page was built for publication: Finding large rainbow trees in colourings of \(K_{n, n}\)