{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:43:45Z","timestamp":1787323425958,"version":"build-2736575974"},"reference-count":19,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>A graph G is r-Ramsey-minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. In this paper we show that for any integer $k \\geq 3$ and $r \\geq 2$, there exists a constant $c&gt;1$ such that for large enough n, there exist at least $c^{n^2}$ nonisomorphic graphs on at most n vertices, each of which is r-Ramsey-minimal with respect to the complete graph $K_k$. Furthermore, in the case $r=2$, we give an asymmetric version of the above result.<\/jats:p>","DOI":"10.1137\/050647116","type":"journal-article","created":{"date-parts":[[2008,3,20]],"date-time":"2008-03-20T18:03:58Z","timestamp":1206036238000},"page":"467-488","source":"Crossref","is-referenced-by-count":16,"title":["On Ramsey Minimal Graphs"],"prefix":"10.1137","volume":"22","author":[{"given":"V.","family":"R\u00f6dl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Siggers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2008,3,20]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1590\/S0104-65002001000200005"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90165-0"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(81)90266-1"},{"key":"R4","unstructured":"S. Burr, P. Erds\u02dd, R. Faudree, C. Rousseau, and R. Schelp,\n                      Ramsey-minimal graphs for matchings,\n                      in The Theory and Applications of Graphs (Kalamazoo, MI 1980), Wiley, New York, 1981, pp. 159\u2013168."},{"key":"R5","first-page":"265","volume":"15","author":"Burr S.","year":"1980","journal-title":"Studia Sci. Math. Hungar.","ISSN":"https:\/\/id.crossref.org\/issn\/0081-6906","issn-type":"print"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(78)90036-7"},{"key":"R7","first-page":"167","volume":"1","author":"Burr S.","year":"1976","journal-title":"Ars Combin.","ISSN":"https:\/\/id.crossref.org\/issn\/0381-7032","issn-type":"print"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(85)80003-2"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.11.043"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90057-3"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02020444"},{"key":"R12","first-page":"117","volume":"31","author":"Faudree R.","year":"1991","journal-title":"Ars Combin.","ISSN":"https:\/\/id.crossref.org\/issn\/0381-7032","issn-type":"print"},{"key":"R13","unstructured":"R. Faudree and J. Sheehan,\n                      Tree Ramsey minimal graphs,\n                      in Proceedings of the Thirteenth Annual Southeastern Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1982), Congr. Numer. 35, Utilitas Math., Winnipeg, 1982, pp. 295\u2013315."},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01894680"},{"key":"R15","doi-asserted-by":"crossref","first-page":"Resear","DOI":"10.37236\/1184","volume":"1","author":"\u0141uczak T.","year":"1994","journal-title":"Electron. J. Combin.","ISSN":"https:\/\/id.crossref.org\/issn\/1077-8926","issn-type":"print"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01902367"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(79)90084-4"},{"key":"R18","unstructured":"J. Ne\u0161et\u0159il and V. R\u00f6dl,\n                      On Ramsey minimal graphs\n                      , in Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Colloques Internationaux C.N.R.S. 260, Orsay, 1976, pp. 307\u2013309."},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.2307\/2152833"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/050647116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:01:41Z","timestamp":1787320901000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/050647116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1137\/050647116"],"URL":"https:\/\/doi.org\/10.1137\/050647116","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}