Browsing by Subject "Cycle"
Now showing items 1-2 of 2
-
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 Ramsey number for two graphs of order 5
( Taylor and Francis Ltd. , 2018 , Article)For two graphs F1 and F2, the Ramsey number R(F1, F2) is the smallest positive integer r such that for every graph G on r vertices, G contains F1 as a subgraph or the complement of G contains F2 as a subgraph. We present ...