Repository logo
Communities & Collections
All of WIReDSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Tivane, Amukelani"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Thumbnail Image
    Item
    The bipartite ramsey number of cycles
    (2021) Tivane, Amukelani
    The Ramsey number R(H1, H2) of two graphs H1 and H2 is the smallest positive integer n for which every red-blue coloring of the complete graph Kn of order n results in a subgraph of Kn isomorphic to H1 all of whose edges are colored red (called a red H1), or a subgraph of Kn isomorphic to H2 all of whose edges are colored blue (called a blue H2). The s-bipartite Ramsey number bs(H1, H2) of two bipartite graphs H1 and H2 is the smallest positive integer t, with t ≥ s, such that every red-blue coloring of the complete bipartite graph Ks,t results in a red H1 or a blue H2. For s = t, the sbipartite Ramsey number is known as the bipartite Ramsey number, which we denote by b(H1, H2). In this dissertation we investigate b(C2m, C2n) and bs(C2m, C2n) for m ≥ 2 and n ≥ 2.

DSpace software copyright © 2002-2025 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify