Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs

DOI10.1007/s11083-015-9384-6zbMath1403.06002OpenAlexW2229458047WikidataQ59477146 ScholiaQ59477146MaRDI QIDQ2520724

István Tomon

Publication date: 16 December 2016

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-015-9384-6

zbMATH Keywords

posetbipartite graphDilworth's theoremTuran problem

Mathematics Subject Classification ID

Partial orders, general (06A06) Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07)

Related Items

Planar point sets determine many pairwise crossing segments ⋮ Improved Ramsey-type results for comparability graphs ⋮ Ordered graphs and large bi-cliques in intersection graphs of curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turán-type results for partial orders and intersection graphs of convex sets
• A bipartite analogue of Dilworth's theorem
• A bipartite analogue of Dilworth's theorem for multiple partial orders
• Some geometric applications of Dilworth's theorem
• Point sets with every triangle having a large angle
• A decomposition theorem for partially ordered sets
• A Ramsey-Type Result for Convex Sets
• On Representatives of Subsets