Anti-Ramsey number of matchings in hypergraphs

DOI10.1016/J.DISC.2013.06.015MaRDI QIDQ393472zbMATH OpenOpenAlexFDO

Authors Lale Özkahya, Michael Young

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

rainbowmatchinghypergraphanti-Ramsey

Mathematics Subject Classification ID

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

Recommendations

• Anti-Ramsey number of matchings in a hypergraph
• Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
• Rainbow matchings in properly-colored hypergraphs
• The anti-Ramsey number of perfect matching
• Anti-Ramsey hypergraph numbers

Cites work

• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• An anti-Ramsey theorem
• Complete solution for the rainbow numbers of matchings
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On maximal paths and circuits of graphs
• Rainbow generalizations of Ramsey theory: A survey
• Rainbow numbers for matchings and complete graphs
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• The anti-Ramsey number of perfect matching

Cited in

(31)

• Anti-Ramsey numbers of doubly edge-critical graphs
• Families with no matchings of size s
• Anti-Ramsey number of matchings in outerplanar graphs
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• The Erdős matching conjecture and concentration inequalities
• Improved bounds for rainbow numbers of matchings in plane triangulations
• On vertex independence number of uniform hypergraphs
• Rainbow disjoint union of \(P_4\) and a matching in complete graphs
• Rainbow numbers for paths in planar graphs
• Rainbow numbers for small graphs in planar graphs
• The anti-Ramsey number of perfect matching
• Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
• Rainbow matchings in an edge-colored planar bipartite graph
• Ramsey theory constructions from hypergraph matchings
• Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
• Anti-Ramsey numbers for matchings in regular bipartite graphs
• Anti-Ramsey number of disjoint union of star-like hypergraphs
• On rainbow matchings in plane triangulations
• Rainbow number of matchings in planar graphs
• Anti-Ramsey Multiplicities
• Rainbow matchings in edge-colored complete split graphs
• Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs
• 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
• Anti-Ramsey hypergraph numbers
• Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs
• Exact rainbow numbers for matchings in plane triangulations
• The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
• Anti-Ramsey number of matchings in a hypergraph
• Anti-Ramsey numbers of paths and cycles in hypergraphs

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

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