Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Ramsey graphs cannot be defined by real polynomials

From MaRDI portal
Publication:3970897
Jump to:navigation, search

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

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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3970897&oldid=11994663"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki