13 citations to https://www.mathnet.ru/eng/jcthb2
  1. Yaping Mao, Kenta Ozeki, Aaron Robertson, Zhao Wang, “Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings”, Journal of Combinatorial Theory, Series A, 193 (2023), 105672  crossref
  2. Yu. A. Demidovich, “On Some Generalizations of the Property B Problem of an n-Uniform Hypergraph”, J Math Sci, 262:4 (2022), 457  crossref
  3. Kai An Sim, Kok Bin Wong, “Minimum Number of Colours to Avoid k-Term Monochromatic Arithmetic Progressions”, Mathematics, 10:2 (2022), 247  crossref
  4. A. E. Khuzieva, “Random Constructions of Hypergraphs with Large Girth and Without Panchromatic Colorings”, J Math Sci, 262:4 (2022), 581  crossref
  5. Yu. A. Demidovich, “New lower bound for the minimal number of edges of simple uniform hypergraph without the property $B_k$”, Discrete Math. Appl., 32:3 (2022), 155–176  mathnet  mathnet  crossref  crossref
  6. Margarita Akhmejanova, Dmitry Shabanov, “Coloring hypergraphs with bounded cardinalities of edge intersections”, Discrete Mathematics, 343:4 (2020), 111692  crossref
  7. Yu. A. Demidovich, “2-Colorings of Hypergraphs with Large Girth”, Math. Notes, 108:2 (2020), 188–200  mathnet  mathnet  crossref  crossref  isi  scopus
  8. Margarita B. Akhmejanova, Dmitry A. Shabanov, “Equitable colorings of hypergraphs with few edges”, Discrete Applied Mathematics, 276 (2020), 2  crossref
  9. A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146  mathnet  mathnet  crossref  crossref  isi  scopus
  10. Dmitry Kravstov, Nikolay Krokhmal, Dmitry Shabanov, “Panchromatic 3-colorings of random hypergraphs”, European J. Combin., 78 (2019), 28–43  mathnet  crossref  isi  scopus
1
2
Next