A structure theorem for pseudosegments and its applications
From MaRDI portal
Cites work
- A bipartite analogue of Dilworth's theorem
- A combinatorial problem in geometry.
- A computational approach to Conway's thrackle conjecture
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- A separator theorem for string graphs and its applications
- A Tverberg-type result on multicolored simplices
- Applications of the crossing number
- Bounds for generalized thrackles
- Combinatorial Geometry and Graph Theory
- Constructing Planar Cuttings in Theory and Practice
- Crossing patterns of segments
- Crossing patterns of semi-algebraic sets
- Density theorems for bipartite graphs and related Ramsey-type results
- Enumeration of intersection graphs of x-monotone curves
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Erdős-Hajnal-type results on intersection patterns of geometric objects
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 1786524 (Why is no real title available?)
- scientific article; zbMATH DE number 2086426 (Why is no real title available?)
- scientific article; zbMATH DE number 5035595 (Why is no real title available?)
- Induced Ramsey-type theorems
- Induced subgraph density. I: A loglog step towards Erdős-Hajnal
- Intersection patterns of curves
- Large homogeneous submatrices
- On Conway's thrackle conjecture
- On grids in topological graphs
- On the speed of algebraically defined graph classes
- On universality of graphs with uniformly distributed edges
- Proof of a conjecture of Burr, Grünbaum, and Sloane
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Ramsey-type theorems
- Regularity lemmas for stable graphs
- Semispaces of configurations, cell complexes of arrangements
- Separator theorems and Turán-type results for planar intersection graphs
- Separators in region intersection graphs
- Some remarks on the theory of graphs
- String graphs have the Erdős-Hajnal property
- The Erdős-Hajnal conjecture. A survey
- Thrackles: an improved upper bound
- Turán-type results for partial orders and intersection graphs of convex sets
- Twisted ways to find plane structures in simple drawings of complete graphs
- Which crossing number is it anyway?
This page was built for publication: A structure theorem for pseudosegments and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951205)