Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs

DOI10.1137/22m1503178zbMath1529.05107arXiv2305.15631MaRDI QIDQ6046825

Xing Peng, Hongliang Lu, Mingyang Guo

Publication date: 6 September 2023

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

Full work available at URL: https://arxiv.org/abs/2305.15631

zbMATH Keywords

hypergraphanti-Ramsey numberrainbow matchingErdős matching conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Anti-Ramsey number of matchings in hypergraphs
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• On matchings in hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• 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
• Near perfect coverings in graphs and hypergraphs
• Proof of the Erdős matching conjecture in a new range
• Rainbow numbers for matchings and complete graphs
• Matchings in 3-uniform hypergraphs
• On non-trivial families without a perfect matching
• Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
• On the rainbow matching conjecture for 3-uniform hypergraphs
• The Erdős matching conjecture and concentration inequalities
• Anti-Ramsey number of matchings in a hypergraph
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• On Erdős' extremal problem on matchings in hypergraphs
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• The Size of a Hypergraph and its Matching Number
• Recent advances on Dirac-type problems for hypergraphs
• On maximal paths and circuits of graphs
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• A Stability Result on Matchings in 3-Uniform Hypergraphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• An anti-Ramsey theorem

This page was built for publication: Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs