Ramsey properties of semilinear graphs

DOI10.1007/s11856-022-2390-7zbMath1515.05126arXiv2102.12464OpenAlexW3132936900MaRDI QIDQ6161733

István Tomon

Publication date: 5 June 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numbersymmetric Ramsey problem for semilinear graphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (2)

Ramsey numbers of semi-algebraic and semi-linear hypergraphs ⋮ Coloring lines and Delaunay graphs with respect to boxes

Cites Work

• Unnamed Item
• Unnamed Item
• Triangle-free intersection graphs of line segments with large chromatic number
• The early evolution of the \(H\)-free process
• On the chromatic number of multiple interval graphs and overlap graphs
• A note on Ramsey numbers
• Intersection theorems with geometric consequences
• On point covers of parallel rectangles
• Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
• Crossing patterns of semi-algebraic sets
• Ramsey-type results for semi-algebraic relations
• Graph Theory and Probability
• On a Coloring Problem.
• A Ramsey-Type Result for Convex Sets
• ARRANGEMENTS OF HOMOTHETS OF A CONVEX BODY
• Circle graphs are quadratically χ‐bounded
• Hasse diagrams with large chromatic number
• Zarankiewicz’s problem for semilinear hypergraphs
• Box and Segment Intersection Graphs with Large Girth and Chromatic Number
• Minkowskian Distribution of Discs
• Applications of a New Separator Theorem for String Graphs
• Some remarks on the theory of graphs
• Constructive lower bounds for off-diagonal Ramsey numbers

This page was built for publication: Ramsey properties of semilinear graphs