R(K₆-e,K₄) =30^

DOI10.1007/S00373-025-02896-8MaRDI QIDQ7031902zbMATH OpenFDO

Authors David James, Elisha Kahan, Erik Rauer

Publication date 6 February 2025

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-025-02896-8

zbMATH Keywords

graph enumerationRamsey theorysmall Ramsey numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites work

• R(4, 5) = 25
• A lower bound for r(5, 5)
• Algorithm 457: finding all cliques of an undirected graph
• All triangle-graph ramsey numbers for connected graphs of order six
• ARTICLES
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• scientific article; zbMATH DE number 5716953 (Why is no real title available?)
• scientific article; zbMATH DE number 4057551 (Why is no real title available?)
• Semidefinite programming and Ramsey numbers
• Some small ramsey numbers

This page was built for publication: \({\mathcal{R}}(K_6-e,K_4) =30^\ast\)

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