Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.07401

On the size multipartite Ramsey numbers involving complete graphs

Leila Maherani·Maryam Shahsiah
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given two graphs H and G, the size multipartite Ramsey number mj (H, G) is the smallest natural number t such that an arbitrary coloring of the edges of Kjt, complete multipartite graph whose vertex set is partitioned into j parts each of size t, using two colors red and blue, necessarily forces a red copy of H or a blue copy of G as a subgraph. The notion of size multipartite Ramsey number has been introduced by Burger and Vuuren in 2004. It is worth noting that, this concept is derived by using the idea of the original classical Ramsey number, multipartite Ramsey number and the size Ramsey number. In this paper, we focus on mj(H, G) and find a lower bound for mj (H, G) based on the chromatic number of H and the order of G. Also, for graphs G with large maximum degree, we obtain a tight lower bound for mj(Km, G). Furthermore, we determine the order of magnitude of mj(Km, K1,n), for j >= m >= 3 and n >= 2. Then we specify the exact values of mj(Km, K1,n) for the cases m = j, m = 3 and j = 0 or m-2 (mod m-2).

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leila Maherani, Maryam Shahsiah. 2024-07-10. On the size multipartite Ramsey numbers involving complete graphs. https://arxiv.org/abs/2407.07401

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗