Crossing patterns of segments
From MaRDI portal
Publication:5953378
DOI10.1006/jcta.2001.3184zbMath0989.05031OpenAlexW2053910492MaRDI QIDQ5953378
Publication date: 11 March 2002
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/18805c53343c3cc050d6b0c8e5c301d9cb97798e
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
A bipartite analogue of Dilworth's theorem, Turán-type results for partial orders and intersection graphs of convex sets, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, String graphs have the Erdős-Hajnal property, On the obfuscation complexity of planar graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On the speed of algebraically defined graph classes, A bipartite strengthening of the crossing Lemma, Unnamed Item, A Bipartite Strengthening of the Crossing Lemma, Dependent random choice, Vertex-minors and the Erdős-Hajnal conjecture, Crossing patterns of semi-algebraic sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs requiring exponential representations
- Intersection graphs of curves in the plane
- Graphs drawn with few crossings per edge
- Intersection graphs of segments
- A positive fraction Erdős-Szekeres theorem
- Not all graphs are segment \(T\)-graphs
- A left-first search algorithm for planar graphs
- Crossing-Free Subgraphs
- Multivariate regression depth
- Lower Bounds for Approximation by Nonlinear Manifolds
- On the Betti Numbers of Real Varieties
- On a problem of K. Zarankiewicz
