Ramsey graphs cannot be defined by real polynomials

DOI10.1002/JGT.3190140605MaRDI QIDQ3970897zbMATH OpenOpenAlexFDO

Authors Noga Alon

Publication date 25 June 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190140605

zbMATH Keywords

color classRamsey boundsRamsey graphsreal polynomial

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 426364
• Graph Ramsey theory and the polynomial hierarchy
• Graph Ramsey theory and the polynomial hierarchy
• Characterizing polynomial Ramsey quantifiers
• scientific article; zbMATH DE number 57428
• Ramsey unsaturated and saturated graphs
• Classes of Graphs that Are Not Vertex Ramsey
• Ramseyan properties of graphs
• Irredundant ramsey numbers for graphs
• Irredundant ramsey numbers for graphs

Cited in

(7)

• Crossing patterns of semi-algebraic sets
• On the number of zero-patterns of a sequence of polynomials
• Constructing Ramsey graphs from Boolean function representations
• A Note on Explicit Ramsey Graphs and Modular Sieves
• Ramsey properties of algebraic graphs and hypergraphs
• Ramsey graphs contain many distinct induced subgraphs
• A bipartite analogue of Dilworth's theorem

This page was built for publication: Ramsey graphs cannot be defined by real polynomials

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