The Matching Ramsey Number of Hypergraphs, Revisited

Saeed Shaebani, Meysam Alishahi

Suppose that a hypergraph $\mathcal{H}$ and an arbitrary nonempty (finite or infinite) set of available colors are given. Each color $x$ is associated with a frequency $\tau (x)$, whe…