The Ramsey number of an \(n\)-edge graph versus triangle is at most \(2n+1\)
From MaRDI portal
Publication:1325260
DOI10.1006/jctb.1993.1036zbMath0794.05090MaRDI QIDQ1325260
Publication date: 15 June 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1993.1036
05C55: Generalized Ramsey theory
Related Items