On a Quasi‐Ramsey problem

Paul Erdös, János Pach

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

It is proved that if a graph G has atleast cn log n vertices, then either G or its complement G contains a subgraph H with atleast n vertices and minimum degree atleast

Original languageEnglish
Pages (from-to)137-147
Number of pages11
JournalJournal of Graph Theory
Volume7
Issue number1
DOIs
Publication statusPublished - 1983

Fingerprint

Vertex Degree
Minimum Degree
Subgraph
Complement
Graph in graph theory

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

On a Quasi‐Ramsey problem. / Erdös, Paul; Pach, János.

In: Journal of Graph Theory, Vol. 7, No. 1, 1983, p. 137-147.

Research output: Contribution to journalArticle

Erdös, Paul ; Pach, János. / On a Quasi‐Ramsey problem. In: Journal of Graph Theory. 1983 ; Vol. 7, No. 1. pp. 137-147.
@article{08387fd30db44766996269458dc69c5f,
title = "On a Quasi‐Ramsey problem",
abstract = "It is proved that if a graph G has atleast cn log n vertices, then either G or its complement G contains a subgraph H with atleast n vertices and minimum degree atleast",
author = "Paul Erd{\"o}s and J{\'a}nos Pach",
year = "1983",
doi = "10.1002/jgt.3190070117",
language = "English",
volume = "7",
pages = "137--147",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - On a Quasi‐Ramsey problem

AU - Erdös, Paul

AU - Pach, János

PY - 1983

Y1 - 1983

N2 - It is proved that if a graph G has atleast cn log n vertices, then either G or its complement G contains a subgraph H with atleast n vertices and minimum degree atleast

AB - It is proved that if a graph G has atleast cn log n vertices, then either G or its complement G contains a subgraph H with atleast n vertices and minimum degree atleast

UR - http://www.scopus.com/inward/record.url?scp=84986440302&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986440302&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190070117

DO - 10.1002/jgt.3190070117

M3 - Article

VL - 7

SP - 137

EP - 147

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -