Coloring Theorems

Coloring Theorems is a mathematical framework within combinatorial set theory that establishes conditions under which certain colorings of sets or their subsets must exhibit specific monochromatic configurations, thereby characterizing structural regularities in infinite and finite combinatorics.

1.4K

Publications

52.3K

Citations

1.7K

Authors

745

Institutions

Publications per year

2017–2026

143

Authors

1.7K

  1. AK
    Alexandr Kostochka

    University of Illinois Urbana-Champaign, United States

    28 publications · 1.1K citations

    20

    h-index

  2. OV
    O. V. Borodin

    Sobolev Institute of Mathematics, Russia

    26 publications · 1.5K citations

    19

    h-index

  3. XZ
    Xuding Zhu

    National Sun Yat-sen University, Taiwan

    23 publications · 868 citations

    17

    h-index

  4. NA
    Noga Alon

    Tel Aviv University, Israel

    18 publications · 1.1K citations

    16

    h-index

  5. RŠ
    Riste Škrekovski

    University of Ljubljana, Slovenia

    22 publications · 740 citations

    15

    h-index

1–5 of 1.7K

Venues

  1. Discrete Mathematics

    156 publications · 5.2K citations

    37

    h-index

  2. Journal of Graph Theory

    139 publications · 4.8K citations

    35

    h-index

  3. Journal of Combinatorial Theory Series B

    65 publications · 3.5K citations

    34

    h-index

  4. The Electronic Journal of Combinatorics

    73 publications · 2.1K citations

    29

    h-index

  5. Discrete Applied Mathematics

    58 publications · 2K citations

    26

    h-index

1–5