PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 2018Discussiones Mathematicae Graph Theory5 citationsOpen Access

Another view of bipartite Ramsey numbers

ZBZhenming BiGCGary ChartrandPZPing Zhang

Key Points

Key points are not available for this paper at this time.

Abstract

For bipartite graphs F and H and a positive integer s, the s-bipartite Ramsey number BR s (F, H) of F and H is the smallest integer t with t s such that every red-blue coloring of K s, t results in a red F or a blue H. We evaluate this number for all positive integers s when F = K 2, 2 and H K 2, 3, K 3, 3.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Bi et al. (2018) studied this question.

synapsesocial.com/papers/6a22ee0db171aa1b1ecac0f2https://doi.org/10.7151/dmgt.2034
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Stars and Their k-Ramsey Numbers2017 · 3 citations
  2. 2A Problem in Combinatorics1974 · 53 citations
  3. 3Die Theorie der regulären graphs1891 · 825 citations
  4. 4On the existence of specified cycles in complementary graphs1971 · 43 citations
  5. 5Some Theorems on Abstract Graphs1952 · 1,603 citations