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
Parents
1.4K
Choice Reviews Online · 1995 · 1.3K citations
István Beck · Journal of Algebra · 1988 · 1.2K citations
The NP-Completeness of Edge-Coloring
Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations
Towards a theory of domination in graphs
E. J. Cockayne, Stephen T. Hedetniemi · Networks · 1977 · 635 citations
1–5 of 1.4K
1.7K
University of Illinois Urbana-Champaign, United States
28 publications · 1.1K citations
20
h-index
19
h-index
17
h-index
16
h-index
15
h-index
1–5 of 1.7K
745

Centre National de la Recherche Scientifique
Paris, France
25 h-index
80 publications
2.1K citations
University of Illinois Urbana-Champaign
Urbana, United States
24 h-index
65 publications
2.3K citations

Hungarian Academy of Sciences
Budapest, Hungary
23 h-index
58 publications
2K citations
Charles University
Prague, Czechia
20 h-index
47 publications
1.4K citations

Tel Aviv University
Tel Aviv, Israel
20 h-index
45 publications
2.1K citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
19 h-index
36 publications
1.1K citations

University of Ljubljana
Ljubljana, Slovenia
19 h-index
35 publications
1.4K citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
18 h-index
51 publications
1.7K citations
1–8 of 745
156 publications · 5.2K citations
37
h-index
139 publications · 4.8K citations
35
h-index
65 publications · 3.5K citations
34
h-index
73 publications · 2.1K citations
29
h-index
58 publications · 2K citations
26
h-index
1–5