String graphs and incomparability graphs
Authors:
- Jacob FoxJFJacob Fox
- János PachJPJános Pach
- 1 June 2012
- journal article
- research article
- Published by Elsevier in Advances in Mathematics
- Vol. 230 (3) , 1381-1401
Abstract
No abstract availableKeywords
Funding Information
- NSF Graduate Research Fellowship
- Princeton Centennial Fellowship
- Simons Fellowship
- NSF (DMS-1069197)
- Hungarian Science Foundation EuroGIGA (OTKA NN 102029)
- Swiss National Science Foundation (200021-125287/1)
- NSF (CCF-08-30272)
This publication has 28 references indexed in Scilit:
- On the Ramsey multiplicity of complete graphsCombinatorica, 2012
- Intersection patterns of curvesJournal of the London Mathematical Society, 2011
- Turán-type results for partial orders and intersection graphs of convex setsIsrael Journal of Mathematics, 2010
- A bipartite strengthening of the Crossing LemmaJournal of Combinatorial Theory, Series B, 2010
- On grids in topological graphs2009
- A Bipartite Analogue of Dilworth’s TheoremOrder, 2006
- On the maximum number of edges in topological graphs with no four pairwise crossing edges2006
- Intersection graphs of curves in the planeJournal of Combinatorial Theory, Series B, 1976
- ON THE TOPOLOGY OF THE GENETIC FINE STRUCTUREProceedings of the National Academy of Sciences, 1959
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950