Exact Turán numbers are determined for k disjoint s-cliques and r-cliques in r-partite s-uniform hypergraphs, and for counting s-cliques in kK_r-free r-partite graphs, under explicit size conditions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tur\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs
Exact Turán numbers are determined for k disjoint s-cliques and r-cliques in r-partite s-uniform hypergraphs, and for counting s-cliques in kK_r-free r-partite graphs, under explicit size conditions.