The connected size Ramsey number for matchings versus small disconnected graphs

DOI10.5614/EJGTA.2019.7.1.9zbMath1467.05263OpenAlexW2940394576WikidataQ128040877 ScholiaQ128040877MaRDI QIDQ5009937

Hilda Assiyatun, Budi Rahadjeng, Edy Tri Baskoro

Publication date: 23 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2019.7.1.9

zbMATH Keywords

matchingdisconnected graphconnected size Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (1)

An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The size Ramsey number of a directed path
• The size Ramsey number
• Connected size Ramsey number for matchings vs. small stars or cycles
• Size Ramsey numbers for some regular graphs

This page was built for publication: The connected size Ramsey number for matchings versus small disconnected graphs