Joos, F., Mubayi, D., & Smith, Z. (2026). Conflict-free hypergraph matchings and coverings. Combinatorics, probability & computing, 35(2), . https://doi.org/10.1017/S0963548325100291
Chicago Style (17th ed.) CitationJoos, Felix, Dhruv Mubayi, and Zachary Smith. "Conflict-free Hypergraph Matchings and Coverings." Combinatorics, Probability & Computing 35, no. 2 (2026). https://doi.org/10.1017/S0963548325100291.
MLA (9th ed.) CitationJoos, Felix, et al. "Conflict-free Hypergraph Matchings and Coverings." Combinatorics, Probability & Computing, vol. 35, no. 2, 2026, https://doi.org/10.1017/S0963548325100291.
Warning: These citations may not always be 100% accurate.