Improved Ramsey-type results for comparability graphs

DOI10.1017/S0963548320000103zbMath1462.05250arXiv1810.00588MaRDI QIDQ4987258

Dániel Korándi, István Tomon

Publication date: 30 April 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

disjointness graphbiclique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (2)

Unnamed Item ⋮ Large Homogeneous Submatrices

Cites Work

• Unnamed Item
• Unnamed Item
• Turán-type results for partial orders and intersection graphs of convex sets
• Ramsey-type constructions for arrangements of segments
• On the chromatic number of disjointness graphs of curves
• A bipartite analogue of Dilworth's theorem
• A bipartite analogue of Dilworth's theorem for multiple partial orders
• The isoperimetric number of random regular graphs
• A note on Ramsey numbers
• Some geometric applications of Dilworth's theorem
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Ramsey-type results for unions of comparability graphs
• Bounds on the chromatic number of intersection graphs of sets in the plane
• Conflict-free coloring of points and simple regions in the plane
• Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs
• Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
• A Ramsey-Type Result for Convex Sets
• Colouring arcwise connected sets in the plane. I

This page was built for publication: Improved Ramsey-type results for comparability graphs