Anti-Ramsey number of matchings in a hypergraph
From MaRDI portal
Publication:2231708
DOI10.1016/j.disc.2021.112594zbMath1478.05095OpenAlexW3198862253MaRDI QIDQ2231708
Publication date: 30 September 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112594
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (5)
Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Anti-Ramsey numbers in complete split graphs
- Anti-Ramsey number of matchings in hypergraphs
- Rainbow numbers for matchings in plane triangulations
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Rainbow generalizations of Ramsey theory: A survey
- The rainbow number of matchings in regular bipartite graphs
- The anti-Ramsey number of perfect matching
- On restricted colourings of \(K_ n\)
- Rainbow numbers for cycles with pendant edges
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Bipartite rainbow numbers of matchings
- Complete solution for the rainbow numbers of matchings
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Rainbow number of matchings in planar graphs
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Rainbow matchings in edge-colored complete split graphs
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- On the anti-Ramsey numbers of linear forests
- Anti-Ramsey number of triangles in complete multipartite graphs
- Anti-Ramsey problems for cycles
- Rainbow triangles in edge-colored Kneser graphs
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Planar anti-Ramsey numbers of paths and cycles
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
- Anti-Ramsey numbers for graphs with independent cycles
- Planar anti-Ramsey numbers of matchings
- Rainbow triangles in edge-colored graphs
- An anti-Ramsey theorem on cycles
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
- On the anti-Ramsey number of forests
- Exact rainbow numbers for matchings in plane triangulations
- Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees
- Bipartite anti-Ramsey numbers of cycles
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Rainbow Numbers for Cycles in Plane Triangulations
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
- An anti-Ramsey theorem
- Rainbow cliques in edge-colored graphs
This page was built for publication: Anti-Ramsey number of matchings in a hypergraph
