Erdős-Hajnal-type results for monotone paths

DOI10.1016/j.jctb.2021.05.004zbMath1472.05084arXiv2004.04594OpenAlexW3166040397MaRDI QIDQ1984509

István Tomon, János Pach

Publication date: 16 September 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.04594

zbMATH Keywords

ordered graphsErdős-Hajnal conjecture

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38)

Related Items (4)

Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix ⋮ Erdős–Hajnal for graphs with no 5‐hole ⋮ Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs ⋮ Pure Pairs VI: Excluding an Ordered Tree

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• A bipartite analogue of Dilworth's theorem
• Density theorems for bipartite graphs and related Ramsey-type results
• On universality of graphs with uniformly distributed edges
• The isoperimetric number of random regular graphs
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Vertex-minors and the Erdős-Hajnal conjecture
• Pure pairs. II: Excluding all subdivisions of a graph
• Pure pairs. I: Trees and linear anticomplete pairs
• Towards Erdős-Hajnal for graphs with no 5-hole
• Ordered graphs and large bi-cliques in intersection graphs of curves
• The Erdős-Hajnal conjecture for paths and antipaths
• Crossing patterns of semi-algebraic sets
• The Erdös-Hajnal Conjecture-A Survey
• A Ramsey-Type Theorem for Orderings of a Graph
• Large Homogeneous Submatrices
• Induced Ramsey-type theorems
• Ramsey-type theorems with forbidden subgraphs

This page was built for publication: Erdős-Hajnal-type results for monotone paths