Ramsey graphs cannot be defined by real polynomials

DOI10.1002/jgt.3190140605zbMath0743.05025OpenAlexW2142818154MaRDI QIDQ3970897

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

real polynomialRamsey graphscolor classRamsey bounds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

A bipartite analogue of Dilworth's theorem ⋮ On the number of zero-patterns of a sequence of polynomials ⋮ Crossing patterns of semi-algebraic sets ⋮ Ramsey graphs contain many distinct induced subgraphs

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