Edge-colorings of complete graphs that avoid polychromatic trees

DOI10.1016/j.disc.2003.09.002zbMath1032.05089OpenAlexW2101857785MaRDI QIDQ1421517

Tao Jiang, Douglas B. West

Publication date: 26 January 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.09.002

zbMATH Keywords

TreeAnti-RamseyEdge-coloring

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (36)

Bipartite anti-Ramsey numbers of cycles ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Improved approximation for maximum edge colouring problem ⋮ On the anti-Ramsey number of forests ⋮ On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids ⋮ Rainbows in the hypercube ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Bounds for bipartite rainbow Ramsey numbers ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Anti-Ramsey numbers for trees in complete multi-partite graphs ⋮ Anti-Ramsey problems in the Mycielskian of a cycle ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ Computing the anti-Ramsey number for trees in complete tripartite graph ⋮ On maximum face-constrained coloring of plane graphs with no short face cycles. ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees ⋮ Anti-Ramsey numbers for matchings in 3-regular bipartite graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees ⋮ Rainbow numbers for cycles with pendant edges ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ On the maximal colorings of complete graphs without some small properly colored subgraphs ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ Complete solution for the rainbow numbers of matchings ⋮ Unnamed Item ⋮ Anti-Ramsey numbers of doubly edge-critical graphs ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings ⋮ Anti-Ramsey numbers for vertex-disjoint triangles ⋮ Anti-Ramsey numbers of subdivided graphs ⋮ Rainbow numbers for certain graphs

Cites Work

• On restricted colourings of \(K_ n\)
• Edge-colorings with no large polychromatic stars
• On maximal paths and circuits of graphs
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-colorings of complete graphs that avoid polychromatic trees