Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
two-coloring
Description:
An assignment of one of two colors to elements such as graph vertices, studied in graph theory and combinatorics.
Primary topic:
Limits and Structures in Graph Theory (45%)
Related topics:
Limits and Structures in Graph Theory (45%),
Advanced Graph Theory Research (16%),
Complexity and Algorithms in Graphs (8%)
OpenAlex ID:
keywords/2-coloring
Six Standard Deviations Suffice
1985
·
Joel Spencer
·
Transactions of the American Mathematical Society
·
415
PDF
An algorithmic approach to the Lovász local lemma. I
1991
·
József Beck
·
Random Structures and Algorithms
·
307
Constructive Algorithms for Discrepancy Minimization
2010
·
Nikhil Bansal
·
Annual Symposium on Foundations of Computer Science
·
237
Generalized Ramsey theory for graphs. III. Small off-diagonal numbers
1972
·
Václáv Chvátal
, Frank Harary
·
Pacific Journal of Mathematics
·
207
PDF
Excluding any graph as a minor allows a low tree-width 2-coloring
2004
·
Matt DeVos
, Guoli Ding
, et al.
·
Journal of Combinatorial Theory Series B
·
124
PDF
Discrepancy and approximations for bounded VC-dimension
1993
·
Jiří Matoušek
, Emo Welzl
, et al.
·
COMBINATORICA
·
99
Perfect 2-colorings of a hypercube
2007
·
D. G. Fon-Der-Flaass
·
Siberian Mathematical Journal
·
78
Discrepancy in arithmetic progressions
1996
·
Jiří Matoušek
, Joel Spencer
·
Journal of the American Mathematical Society
·
71
PDF
Algorithmic approach to the satisfactory graph partitioning problem
2000
·
Michael U Gerber
, Daniel Kobler
·
European Journal of Operational Research
·
70
Coloring bipartite hypergraphs
1996
·
Hui Chen
, Alan Frieze
·
Lecture notes in computer science
·
69
Path-path Ramsey-type numbers for the complete bipartite graph
1975
·
R.J Faudree
, R.H Schelp
·
Journal of Combinatorial Theory Series B
·
68
On the Ramsey numbers R(3, 8) and R(3, 9)
1982
·
Charles M Grinstead
, Sam M Roberts
·
Journal of Combinatorial Theory Series B
·
67
PDF
A lower bound for r(5, 5)
1989
·
Geoffrey Exoo
·
Journal of Graph Theory
·
66
Defective 2-colorings of sparse graphs
2013
·
O.V. Borodin
, A.V. Kostochka
·
Journal of Combinatorial Theory Series B
·
64
PDF
Some Problems on Dynamic/Periodic Graphs
1984
·
James B. Orlin
·
Elsevier eBooks
·
64
The number of edge colorings with no monochromatic triangle
1996
·
Raphael Yuster
·
Journal of Graph Theory
·
62
Separator-based data reduction for signed graph balancing
2009
·
Falk Hüffner
, Nadja Betzler
, et al.
·
Journal of Combinatorial Optimization
·
61
Constructive Algorithms for Discrepancy Minimization
2010
·
Bansal, Nikhil
·
arXiv (Cornell University)
·
59
PDF
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5
1999
·
Carsten Thomassen
·
Journal of Combinatorial Theory Series B
·
58
PDF
Balanced two-colorings of finite sets in the square I
1981
·
József Beck
·
COMBINATORICA
·
57
2 -colorings in k -regular k -uniform hypergraphs
2013
·
Michael A. Henning
, Anders Yeo
·
European Journal of Combinatorics
·
48
PDF
On monochromatic solutions of equations in groups
2007
·
Peter J. Cameron
, Javier Cilleruelo
, et al.
·
Revista Matemática Iberoamericana
·
47
PDF
Two‐coloring random hypergraphs
2002
·
Dimitris Achlioptas
, Jeong Han kim
, et al.
·
Random Structures and Algorithms
·
47
Optimal Edge Deletions for Signed Graph Balancing
2007
·
Falk Hüffner
, Nadja Betzler
, et al.
·
Springer eBooks
·
44
A remark on the number of edge colorings of graphs
2005
·
József Balogh
·
European Journal of Combinatorics
·
43
Show more works
View as search
Works count:
444
Citation count:
4,592
Year
Topic
Type