بحث بسيط
السجلات المعروضة 1 -- 1 من 1
The ramsey number for theta graph versus a clique of order three and four
(
University of Zielona Gora
, 2014 , Article)
For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is
the smallest positive integer N with the property that every graph on at
least N vertices contains F1 or its complement contains F2 as a subgraph.
In ...