Anti-Ramsey number of matchings in hypergraphs

DOI10.1016/j.disc.2013.06.015zbMath1281.05111OpenAlexW2027753995MaRDI QIDQ393472

Mohammad Hasan, H. S. Yoon

Publication date: 23 January 2014

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

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

zbMATH Keywords

rainbowhypergraphmatchinganti-Ramsey

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (24)

Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey Hypergraph Numbers ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Rainbow number of matchings in planar graphs ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Families with no matchings of size \(s\) ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey number of disjoint union of star-like hypergraphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs ⋮ Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms ⋮ On rainbow matchings in plane triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Rainbow generalizations of Ramsey theory: A survey
• The anti-Ramsey number of perfect matching
• Complete solution for the rainbow numbers of matchings
• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• Rainbow numbers for matchings and complete graphs
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• An anti-Ramsey theorem

This page was built for publication: Anti-Ramsey number of matchings in hypergraphs