Pages that link to "Item:Q1330876"
From MaRDI portal
The following pages link to Some geometric applications of Dilworth's theorem (Q1330876):
Displaying 23 items.
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← 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)
- 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)
- Symmetric chain partitions of orthocomplemented posets (Q1907545) (← links)
- Applications of the crossing number (Q1920423) (← links)
- Note on geometric graphs (Q1971016) (← links)
- An almost optimal bound on the number of intersections of two simple polygons (Q2105320) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q2206854) (← links)
- On grids in topological graphs (Q2249043) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- Segment orders (Q2380782) (← links)
- On the chromatic number of some geometric type Kneser graphs (Q2387203) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs (Q2520724) (← links)
- (Q2857373) (← links)
- Tangled Thrackles (Q4899263) (← links)
- Improved Ramsey-type results for comparability graphs (Q4987258) (← links)
- (Q5088986) (← links)
- Disjoint edges in geometric graphs (Q5925578) (← links)
- Extremal problems for geometric hypergraphs (Q6487430) (← links)
