Saturation numbers for families of Ramsey-minimal graphs

DOI10.4310/JOC.2011.V2.N3.A5zbMATH Open1252.05090OpenAlexW2031636309MaRDI QIDQ446009FDOQ446009

Authors: Guantao Chen, Michael Ferrara, Colton Magnant, John Schmitt, Ronald Gould 

Publication date: 28 August 2012

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2011.v2.n3.a5

Recommendations

• Saturation numbers for Ramsey-minimal graphs
• Ramsey-minimal saturation numbers for matchings
• Edge-colored saturated graphs
• On edge-colored saturation problems
• The minimum degree of Ramsey-minimal graphs

zbMATH Keywords

Ramsey-minimalsaturation number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Structural characterization of families of graphs (05C75)

Cited In (11)

• Ramsey-minimal saturation numbers for matchings
• Edge-colored saturated graphs
• Saturation problems in the Ramsey theory of graphs, posets and point sets
• A note on the saturation number of the family of \(k\)-connected graphs
• On the size of \((K_t, K_{1, k})\)-co-critical graphs
• Two problems in graph Ramsey theory
• On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs
• On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs
• On the size of \((K_t, P_k)\)-co-critical graphs
• Saturation numbers for Ramsey-minimal graphs
• Minimum saturated families of sets

This page was built for publication: Saturation numbers for families of Ramsey-minimal graphs

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