On a Quasi‐Ramsey problem

DOI10.1002/jgt.3190070117zbMath0511.05047OpenAlexW2003373317WikidataQ105889482 ScholiaQ105889482MaRDI QIDQ4749867

János Pach, Paul Erdős

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070117

zbMATH Keywords

minimum degreesubgraphcomplement of graph

Mathematics Subject Classification ID

Combinatorial probability (60C05) Generalized Ramsey theory (05C55)

Related Items (5)

An extension of Whitney's theorem to infinite strong triangulations ⋮ One-way infinite Hamiltonian paths in infinite maximal planar graphs ⋮ On a Ramsey-type problem of Erdős and Pach ⋮ A Precise Threshold for Quasi-Ramsey Numbers ⋮ The Erdős-Hajnal conjecture for three colors and triangles

This page was built for publication: On a Quasi‐Ramsey problem