Browsing College of Arts & Sciences by Publisher "Tokyo University of Science"
Now showing items 1-3 of 3
-
Edge-maximal graphs without θ 7 -graphs
( Tokyo University of Science , 2011 , Article)Let G(n; θ2k+1, ≥ δ) denote the class of non-bipartite θ2k+1-free graphs on n vertices and minimum degree at least δ and let f (n; θ2k+1, ≥ δ) = max{ε(G): G ∈ G(n; θ2k+1, ≥ δ)}. In this paper we determinj an upker bound ... -
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 . ...