On Ramsey (K₁,2, K_n)-minimal graphs

DOI10.7151/DMGT.1604zbMATH Open1255.05120OpenAlexW2402985489MaRDI QIDQ4647873FDOQ4647873

Authors: Mariusz Hałuszczak 

Publication date: 8 November 2012

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1604

Recommendations

• On Ramsey \((K_{1,2},P_4)\)-minimal graphs
• Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs
• On Ramsey \((K_{1,2,}C_4)\)-minimal graphs
• Ramsey \((K_{1,2}, C_4)\)-minimal graphs
• On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs

zbMATH Keywords

edge coloringcomplete graph1-factorRamsey minimal graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76) Ramsey theory (05D10)

Cited In (8)

• On Ramsey Minimal Graphs
• On Ramsey \((K_{1,2,}C_4)\)-minimal graphs
• On Ramsey \((mK_2,H)\)-minimal graphs
• On the use of senders in generalized Ramsey theory for graphs
• Some infinite families of Ramsey \((P_{3},P_{n})\)-minimal trees
• The Complete List of Ramsey (2K2,K4)-Minimal Graphs
• On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs
• On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles

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

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