Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,017,642 papers from all fields of science
Search
Sign In
Create Free Account
Monochromatic triangle
In graph theory and theoretical computer science, the monochromatic triangle problem is an algorithmic problem on graphs,in which the goal is to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Courcelle's theorem
Decision problem
Graph theory
List of NP-complete problems
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Small minimal $(3, 3)$-Ramsey graphs
Aleksandar Bikov
2016
Corpus ID: 85530983
We say that $G$ is a $(3, 3)$-Ramsey graph if every $2$-coloring of the edges of $G$ forces a monochromatic triangle. The $(3, 3…
Expand
2011
2011
Bichromatic Triangle Games
G. Manic
,
Daniel M. Martin
,
Miloš Stojaković
Electron. Notes Discret. Math.
2011
Corpus ID: 37210261
2008
2008
Finding Folkman Numbers via MAX CUT Problem
A. Dudek
,
V. Rödl
Electron. Notes Discret. Math.
2008
Corpus ID: 15474171
2007
2007
A new construction technique of a triangle-free 3-colored K16's
J. Jaam
Information Sciences
2007
Corpus ID: 26684081
2006
2006
The classical Ramsey number R ( 3 , 3 , 3 , 3 ) ≤ 62 : The global arguments
R. L. Kramer
2006
Corpus ID: 6875554
We show that R(3, 3, 3, 3) ≤ 62, that is, any good edge coloring of a complete graph on 62 vertices with four colors must contain…
Expand
2004
2004
Equilateral Triangles in Finite Metric Spaces
V. Mascioni
Electronic Journal of Combinatorics
2004
Corpus ID: 6397545
In the context of finite metric spaces with integer distances, we investigate the new Ramsey-type question of how many points can…
Expand
1997
1997
On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors
K. Piwakowski
Discrete Mathematics
1997
Corpus ID: 19114276
1996
1996
Remarks on 15-vertex (3, 3)-Ramsey graphs not containing K5
S. Urbanski
Discussiones Mathematicae Graph Theory
1996
Corpus ID: 23548707
The paper gives an account of previous and recent attempts to determine the order of a smallest graph not containing K5 and such…
Expand
1996
1996
A random bit-flipping method for seeking agreement
C. McDiarmid
Random Struct. Algorithms
1996
Corpus ID: 17877266
Recently Papadimitriou has proposed a randomized “bit-flipping” method for solving the 2-satisfiability problem, and the author…
Expand
1983
1983
Ramsey theory and Ramsey theoreticians
J. Spencer
Journal of Graph Theory
1983
Corpus ID: 19592261
An anecdotal account of some of the events and people that have helped shape Ramsey Theory.
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE