Browsing Materials Science & Technology by Subject "Ramsey number"

Now showing items 1-6 of 6

    • A note on the Ramsey number for small graphs 

      Vetrík, Tomáš; Jaradat, Mohammed M. M.; Bataineh, Mohammad S. ( Taylor and Francis Ltd. , 2022 , Article)
      Problems in the Ramsey theory form a well-known family of mathematical problems. We present the exact value of the Ramsey number R(θ6, W5), where θ6 is the set of theta graphs of order 6 and W5 is the wheel graph of order ...

    • Edge-maximal -free non-bipartite Hamiltonian graphs of odd order 

      Jaradat, M. M. M.; Baniabedalruhman, A.; Bataineh, M. S.; Jaradat, A. M. M.; Al-Rhayyel, A. A. ( Taylor and Francis Ltd. , 2022 , Article)
      Let (Formula presented.) denote the class of non-bipartite graphs on n vertices containing no (Formula presented.) -graph and (Formula presented.) Let (Formula presented.) denote the class of non-bipartite Hamiltonian ...

    • The cycle-complete graph Ramsey number r ( C 8 , K 8 ) 

      Jaradat, M.M.M.; Alzaleq, B.M.N. ( 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 

      Jaradat, M.M.M.; Alzaleq, B.M.N. ( 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 . ...

    • The ramsey number for theta graph versus a clique of order three and four 

      Bataineh, M.S.A.; Jaradat, M.M.M.; Bateeha, M.S. ( 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 ...

    • The theta-complete graph Ramsey number r(θk, K5); k = 7, 8, 9 

      Jaradat, A.M.M.; Baniabedalruhman, A.; Bataineh, M.S.; Jaradat, M.M.M. ( Forum-Editrice Universitaria Udinese SRL , 2021 , Article)
      Finding the Ramsey number is an important problem of the well-known family of the combinatorial problems in Ramsey theory. In this work, we investigate the Ramsey number r(θs, K5) for s = 7, 8, 9 where θs is the set of ...