Pages that link to "Item:Q4314565"
From MaRDI portal
The following pages link to A Ramsey-Type Result for Convex Sets (Q4314565):
Displaying 39 items.
- Ramsey-type theorems for sets satisfying a geometric regularity condition (Q342924) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
- Ramsey-type constructions for arrangements of segments (Q661941) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- A bipartite analogue of Dilworth's theorem for multiple partial orders (Q1041604) (← links)
- A combinatorial property of convex sets (Q1355195) (← links)
- A Ramsey property of order types (Q1380338) (← links)
- Improved bounds on the Hadwiger-Debrunner numbers (Q1650467) (← links)
- Symmetric chain partitions of orthocomplemented posets (Q1907545) (← links)
- Note on geometric graphs (Q1971016) (← links)
- On Wegner's inequality for axis-parallel rectangles (Q2005682) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem (Q2189732) (← links)
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs (Q2520724) (← links)
- On Path Convex Ramsey Numbers (Q4596315) (← links)
- Improved Ramsey-type results for comparability graphs (Q4987258) (← links)
- Hasse diagrams with large chromatic number (Q5006387) (← links)
- (Q5088936) (← links)
- (Q5088986) (← links)
- From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem (Q5115819) (← links)
- (Q5202212) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Ramsey-type constructions for arrangements of segments (Q5301021) (← links)
- Helly-type problems (Q5868651) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- Induced Ramsey-type theorems (Q5900433) (← links)
- Finding convex sets in convex positions (Q5932757) (← links)
- Ramsey numbers of semi-algebraic and semi-linear hypergraphs (Q6051048) (← links)
- Disjointness graphs of short polygonal chains (Q6144392) (← links)
- Ramsey properties of semilinear graphs (Q6161733) (← links)
- Lower bounds for piercing and coloring boxes (Q6187716) (← links)
- String graphs have the Erdős-Hajnal property (Q6192228) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
- Strong Erdős-Hajnal properties in chordal graphs (Q6574376) (← links)
