Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
From MaRDI portal
Publication:2075528
DOI10.1016/j.disc.2021.112782zbMath1482.05126arXiv2109.05163OpenAlexW3200592572MaRDI QIDQ2075528
Yi-Sai Xue, Erfang Shan, Li-ying Kang
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.05163
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (4)
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
Cites Work
- Unnamed Item
- Anti-Ramsey number of matchings in hypergraphs
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- The rainbow number of matchings in regular bipartite graphs
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs
- Bipartite rainbow numbers of matchings
- 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
- Anti-Ramsey number of matchings in a hypergraph
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- An anti-Ramsey theorem on cycles
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
This page was built for publication: Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
