On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs

DOI10.1016/J.DISC.2012.06.020zbMath1277.05085OpenAlexW2226766957MaRDI QIDQ383736

Marta Borowiecka-Olszewska, Mariusz Hałuszczak

Publication date: 6 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.06.020

zbMATH Keywords

cyclecomplete bipartite graphcomplete graphedge colouringstar2-connected graphRamsey minimal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Connectivity (05C40)

Related Items (2)

On Ramsey \((mK_2,H)\)-minimal graphs ⋮ The Complete List of Ramsey (2K2,K4)-Minimal Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey-minimal graphs for star-forests
• Ramsey-minimal graphs for forests
• Matching-star Ramsey sets
• Small Ramsey numbers
• Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs
• On Ramsey (K_1,2,C₄)-minimal graphs
• On highly ramsey infinite graphs
• On Ramsey Minimal Graphs
• On Ramsey (K_{1,2},K_{n})-minimal graphs
• On Ramsey minimal graphs
• On Ramsey minimal graphs

This page was built for publication: On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs