PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 5, 2016Order5 citationsOpen Access

Turán-Type Results for Complete h-Partite Graphs in Comparability and Incomparability Graphs

ITIstván Tomon

Key Points

Key points are not available for this paper at this time.

Abstract

We consider an h-partite version of Dilworth’s theorem with multiple partial orders. Let P be a finite set, and let n 1−γ(α), where γ(α) → 0 as α → 1. We provide a few applications of these results in combinatorial geometry, as well.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

István Tomon (2016) studied this question.

synapsesocial.com/papers/69f933e643e50b5d109de116https://doi.org/10.1007/s11083-015-9384-6
Ask AI
Helpful
Bookmark
Share
View Full Paper