Multipartite Ramsey numbers of complete bipartite graphs arising from algebraic combinatorial structures
Abstract
In 2019, Perondi and Carmelo determined the set multipartite Ramsey number of particular complete bipartite graphs by establishing a relationship between the set multipartite Ramsey number, Hadamard matrices, and strongly regular graphs, which is a breakthrough in Ramsey theory. However, since Hadamard matrices of order not divisible by 4 do not exist, many open problems have arisen. In this paper, we generalize Perondi and Carmelo's results by introducing the [α]-Hadamard matrix that we conjecture exists for arbitrary order. Finally, we determine set and size multipartite Ramsey numbers for particular complete bipartite graphs.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.