Saturation numbers for families of Ramsey-minimal graphs
From MaRDI portal
Publication:446009
DOI10.4310/JOC.2011.v2.n3.a5zbMath1252.05090OpenAlexW2031636309MaRDI QIDQ446009
Michael Ferrara, John R. Schmitt, Guantao Chen, Colton Magnant, Ronald J. 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
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Generalized Ramsey theory (05C55)
Related Items (6)
On the size of \((K_t, K_{1, k})\)-co-critical graphs ⋮ On the size of \((K_t, P_k)\)-co-critical graphs ⋮ Ramsey-minimal saturation numbers for matchings ⋮ 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 ⋮ Saturation numbers for Ramsey-minimal graphs
This page was built for publication: Saturation numbers for families of Ramsey-minimal graphs