Some open problems of Ramsey minimal graphs

DOI10.1007/978-3-319-28186-5_28MaRDI QIDQ5354958zbMATH OpenOpenAlexFDO

Authors E. T. Baskoro

Publication date 6 September 2017

Published in Convexity and Discrete Geometry Including Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28186-5_28

zbMATH Keywords

graph classificationmonochromatic matchingRamsey minimal

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On Ramsey \((2K_2, 2 P_n )\)-minimal graphs
• On Ramsey \((4K_2,P_3)\)-minimal graphs
• Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs
• On Ramsey \((mK_2,H)\)-minimal graphs
• On Ramsey (3K₂,P₃)-minimal graphs

Cited in

(1)

• Ramsey minimal graphs for 2K₂ versus P_n

This page was built for publication: Some open problems of Ramsey minimal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5354958)