| Title: | On a conjecture of Erdős on size Ramsey number of star forests |
|---|
| Authors: | ID Davoodi, Akbar (Author) ID Javadi, Ramin (Author) ID Kamranian, Azam (Author) ID Raeisi, Ghaffar (Author) |
| Files: | AMC_Davoodi,Javadi,Kamranian,Raeisi_2025.pdf (282,24 KB) MD5: C287AF1EABEE18F3290CA82BBAEA5698
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | Given two graphs F_1 and F_2, their size Ramsey number, denoted by r̂(F_1, F_2), is the minimum number of edges of a graph G such that for any edge coloring of G by colors red and blue, G contains either a red copy of F1 or a blue copy of F2. In this paper, we deal with the size Ramsey number of star forests (disjoint union of stars) and following a conjecture by Burr, Erdős, Faudree, Rousseau, and Schelp in 1978, we determine the exact value of r̂(⊔_{i = 1}^s K_{1, ni}, ⊔_{i = 1}^t K_{1, mi}) in several cases including when either m_i’s and n_i’s are odd, or s = 1 or s = 2 and n_1 = n_2. |
|---|
| Keywords: | size Ramsey number, star forest, Ramsey minimal graph |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.04.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | 10 str. |
|---|
| Numbering: | Vol. 25, no. 2, [article no.] P2.09 |
|---|
| PID: | 20.500.12556/RUP-21994  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | https://doi.org/10.26493/1855-3974.3081.d6c  |
|---|
| Publication date in RUP: | 21.10.2025 |
|---|
| Views: | 314 |
|---|
| Downloads: | 4 |
|---|
| Metadata: |  |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |