On orthogonal symmetric chain decompositions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10400342" target="_blank" >RIV/00216208:11320/19:10400342 - isvavai.cz</a>
Result on the web
<a href="http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1203" target="_blank" >http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1203</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On orthogonal symmetric chain decompositions
Original language description
The n-cubeis the poset obtained by ordering all subsets of {1,...,n} by inclusion, and it can be partitioned into binom(n,n/2) chains, which is the minimum possible number. Two such decompositions of then-cube are called orthogonal if any two chains of the decompositions share at most a single element.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA19-08554S" target="_blank" >GA19-08554S: Structures and algorithms in highly symmetric graphs</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of Eurocomb 2019
ISBN
—
ISSN
0862-9544
e-ISSN
—
Number of pages
8
Pages from-to
611-618
Publisher name
AMUC
Place of publication
Bratislava
Event location
Bratislava
Event date
Aug 26, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000484349000040