A Ramsey-Type Theorem for Orderings of a Graph

DOI10.1137/0402035zbMath0682.05047OpenAlexW2038404834MaRDI QIDQ4731213

Vojtěch Rödl, Peter M. Winkler

Publication date: 1989

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0402035

zbMATH Keywords

ordered graphRamsey-type results

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Modular lattices, complemented lattices (06C99)

Related Items (8)

On ordered graphs and graph orderings ⋮ Pure pairs. X. Tournaments and the strong Erdős-Hajnal property ⋮ Two Erdős-Hajnal-type theorems in hypergraphs ⋮ Erdős-Hajnal-type results for monotone paths ⋮ Ordered graphs and large bi-cliques in intersection graphs of curves ⋮ Acyclic subgraphs of tournaments with high chromatic number ⋮ On a graph colouring problem ⋮ Pure Pairs VI: Excluding an Ordered Tree

This page was built for publication: A Ramsey-Type Theorem for Orderings of a Graph