Anti-Ramsey number of matchings in hypergraphs
From MaRDI portal
Publication:393472
DOI10.1016/J.DISC.2013.06.015zbMATH Open1281.05111OpenAlexW2027753995MaRDI QIDQ393472FDOQ393472
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
Recommendations
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- Rainbow numbers for matchings and complete graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rainbow generalizations of Ramsey theory: A survey
- The anti-Ramsey number of perfect matching
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Complete solution for the rainbow numbers of matchings
- An anti-Ramsey theorem
Cited In (31)
- Anti-Ramsey numbers of doubly edge-critical graphs
- Anti-Ramsey number of matchings in outerplanar graphs
- Families with no matchings of size \(s\)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- The Erdős matching conjecture and concentration inequalities
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs
- Improved bounds for rainbow numbers of matchings in plane triangulations
- On vertex independence number of uniform hypergraphs
- Rainbow numbers for paths in planar graphs
- Rainbow numbers for small graphs in planar graphs
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- The anti-Ramsey number of perfect matching
- 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
- Anti-Ramsey Multiplicities
- Rainbow number of matchings in planar graphs
- 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
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Exact rainbow numbers for matchings in plane triangulations
- Anti-Ramsey number of matchings in a hypergraph
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
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)
