Separator theorems and Turán-type results for planar intersection graphs

By Jacob Fox, János Pach. 2008

69 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/8df15d260c5871040b1c59fea29b5a7ceee694c2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. János Pach
2. Jacob Fox

In Computer Graphics and Computer-Aided Design

1. Jacob Fox
2. János Pach

In Discrete Mathematics and Combinatorics

1. János Pach
2. Jacob Fox

Citations in the corpus

• Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects (2008, background): “Theorem 4.2 [ 26 ] If C is a finite collection of Jordan regions with a total of m crossings, then the intersection graph of C has a separator of size O( √ m).”