Conflict-free hypergraph matchings and coverings
F Joos, D Mubayi, Z Smith - arXiv preprint arXiv:2407.18144, 2024 - arxiv.org
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has
found many applications. We show that, assuming certain simple degree and codegree …
found many applications. We show that, assuming certain simple degree and codegree …
The generalized Ramsey number
A $(p, q) $-coloring of $ K_n $ is a coloring of the edges of $ K_n $ such that every $ p $-
clique has at least $ q $ distinct colors among its edges. The generalized Ramsey number …
clique has at least $ q $ distinct colors among its edges. The generalized Ramsey number …