The following pages link to Crossing patterns of segments (Q5953378):
Displaying 15 items.
- Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- Vertex-minors and the Erdős-Hajnal conjecture (Q1800420) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
- Crossing patterns of semi-algebraic sets (Q2566809) (← links)
- (Q2857373) (← links)
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
- Dependent random choice (Q3068761) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A Bipartite Strengthening of the Crossing Lemma (Q5452205) (← links)
- String graphs have the Erdős-Hajnal property (Q6192228) (← links)
- Strong Erdős-Hajnal properties in chordal graphs (Q6574376) (← links)
- New bounds for the same-type lemma (Q6574401) (← links)
