Semantic Scholar Open Access 2016 5 sitasi

Combinatorics of `unavoidable complexes'

Marija Jeli'c Duvsko Joji'c Marinko Timotijevi'c Sinivsa T. Vre'cica Rade T. vZivaljevi'c

Lihat Sumber

Abstrak

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is $r$-unavoidable if $\pi(K)\leq r$. Motivated by the problems of Tverberg-Van Kampen-Flores type, and inspired by the `constraint method' of Blagojevi\'{c}, Frick, and Ziegler, arXiv:1401.0690 [math.CO], we study the combinatorics of $r$-unavoidable complexes.

Topik & Kata Kunci

Mathematics

Penulis (5)

Marija Jeli'c

Duvsko Joji'c

Marinko Timotijevi'c

Sinivsa T. Vre'cica

Rade T. vZivaljevi'c

Format Sitasi

APA MLA BibTeX

Jeli'c, M., Joji'c, D., Timotijevi'c, M., Vre'cica, S.T., vZivaljevi'c, R.T. (2016). Combinatorics of `unavoidable complexes'. https://www.semanticscholar.org/paper/f215161010a9532f3f928390492726a9d36629fc

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Total Sitasi: 5×
Sumber Database: Semantic Scholar
Akses: Open Access ✓