Home > Search Results: keywords:"pokrytí párů"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Minimal coverings of pairs by triples
 Hladíková, Veronika ; Krump, Lukáš (advisor) ; Kazda, Alexandr (referee)
In this thesis we deal with solving a combinatorics problem of finding the minimal covering of pairs by triples for a fixed finite set. We will show what is the minimal size of these coverings and more ways how to construct them. Second part of the thesis is a description of the attached program, which generates a minimal covering for a given set. 1
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English