"The Ramsey Number of an N-Edge Graph versus Triangle Is at Most ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

A. F. Sidorenko (1993)

> Home

Details and statistics

DOI: 10.1006/JCTB.1993.1036

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/Sidorenko93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/Sidorenko93
A. F. Sidorenko:
The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1. J. Comb. Theory B 58(2): 185-196 (1993)

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.