A bipartite analogue of Dilworth's theorem for multiple partial orders

DOI10.1016/j.ejc.2008.12.004zbMath1185.06002OpenAlexW2163407691MaRDI QIDQ1041604

Jacob Fox, János Pach

Publication date: 3 December 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/129370

zbMATH Keywords

Dilworth's theoremmulitple partial order

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Related Items

A bipartite analogue of Dilworth's theorem, Turán-type results for partial orders and intersection graphs of convex sets, Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs, Improved Ramsey-type results for comparability graphs, Ordered graphs and large bi-cliques in intersection graphs of curves, Large Homogeneous Submatrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turán-type results for partial orders and intersection graphs of convex sets
• Ramsey-type theorems
• A bipartite analogue of Dilworth's theorem
• Comparability graphs and intersection graphs
• Some geometric applications of Dilworth's theorem
• Ramsey-type results for geometric graphs. I
• Ramsey-type results for unions of comparability graphs
• Note on geometric graphs
• Independent set of intersection graphs of convex objects in 2D
• Crossing patterns of semi-algebraic sets
• A decomposition theorem for partially ordered sets
• Good splitters for counting points in triangles
• A Ramsey-Type Result for Convex Sets
• Intersection patterns of curves
• The structure of Sperner k-families