Browsing by Subject "Cycle graph"
Now showing items 1-2 of 2
-
The cycle-complete graph Ramsey number r ( C 8 , K 8 )
( Tokyo University of Science , 2007 , Article)The cycle-complete graph Ramsey number r ( C m , K n ) is the smallest integer N such that every graph G of order N contains a cycle C m on m vertices or has independent number α ( G ) ≥ n . ... -
The cycle-complete graph Ramsey number r(C6,K8)≤38
( Tokyo University of Science , 2008 , Article)The cycle-complete graph Ramsey number r ( C m , K n ) is the smallest integer N such that every graph G of order N contains a cycle C m on m vertices or has independent number α ( G ) ≥ n . ...