Turán-type results for partial orders and intersection graphs of convex sets
From MaRDI portal
Publication:607823
DOI10.1007/s11856-010-0056-3zbMath1248.05118OpenAlexW2146689185MaRDI QIDQ607823
János Pach, Csaba D. Tóth, Jacob Fox
Publication date: 6 December 2010
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/129371
geometric objectsintersection graphpartially ordered setsincomparability graphbalanced complete bipartite graphconvex sets in the planemonotone curves in the planeRamsey-type resultsTuran type results
Partial orders, general (06A06) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)
Related Items
Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane, String graphs and incomparability graphs, A Separator Theorem for String Graphs and Its Applications, A Bipartite Strengthening of the Crossing Lemma, Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs, A sharp threshold phenomenon in string graphs, Improved Ramsey-type results for comparability graphs, Ordered graphs and large bi-cliques in intersection graphs of curves, A bipartite analogue of Dilworth's theorem for multiple partial orders, Erdös--Hajnal Properties for Powers of Sparse Graphs, Pure Pairs VI: Excluding an Ordered Tree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey-type theorems
- A bipartite analogue of Dilworth's theorem
- The Erdős-Hajnal conjecture for bull-free graphs
- A bipartite analogue of Dilworth's theorem for multiple partial orders
- Circle orders, n-gon orders and the crossing number
- Intersection graphs of curves in the plane
- Some geometric applications of Dilworth's theorem
- On geometric graphs with no \(k\) pairwise parallel edges
- Crossing patterns of semi-algebraic sets
- A decomposition theorem for partially ordered sets
- A Ramsey-Type Result for Convex Sets
- Some remarks on the theory of graphs
- Crossing patterns of segments
- Ramsey-type theorems with forbidden subgraphs