"A new upper bound for the bipartite Ramsey problem."

David Conlon (2008)

> Home

Details and statistics

DOI: 10.1002/JGT.20317

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/Conlon08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Conlon08
David Conlon:
A new upper bound for the bipartite Ramsey problem. J. Graph Theory 58(4): 351-356 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.