A Ramsey-type theorem for bipartite graphs

By P. Erdös, A. Hajnal, János Pach. 2000

56 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/6516d9839335e251cc0a6f84b4241512fa6837a4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Jacob Fox
2. János Pach
3. Guy Moshkovitz

Citations in the corpus

• Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects (2008, background): “Erdýos, Hajnal, and Pach [ 22 ] proved a bipartite variant: There is a constant c = c(G) > 0 such that every graph on n vertices that belongs to”