scientific article; zbMATH DE number 3906534

MaRDI QIDQ3684154zbMATH OpenFDO

Authors Stefan A. Burr

Publication date 1984

zbMATH Keywords

chromatic numberNP-completeRamsey number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Recommendations

• Publication:3201758
• On the complexity of the circular chromatic number
• On the hardness of approximating the chromatic number
• Determining the total colouring number is NP-hard
• Graph Ramsey theory and the polynomial hierarchy

Cited in

(9)

• What can we hope to accomplish in generalized Ramsey theory ?
• The Ramsey number of 3-uniform loose path versus star
• scientific article; zbMATH DE number 4178769 (Why is no real title available?)
• scientific article; zbMATH DE number 1031386 (Why is no real title available?)
• Explicit Construction of RIP Matrices Is Ramsey‐Hard
• On some open questions for Ramsey and Folkman numbers
• Symbolic moment calculus. II: Why is Ramsey theory sooooo eeeenormously hard?
• Graph Ramsey theory and the polynomial hierarchy
• Graph Ramsey theory and the polynomial hierarchy

This page was built for publication:

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