On Asymmetric Hypergraphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10438698" target="_blank" >RIV/00216208:11320/21:10438698 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-030-83823-2_80" target="_blank" >https://doi.org/10.1007/978-3-030-83823-2_80</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-83823-2_80" target="_blank" >10.1007/978-3-030-83823-2_80</a>
Alternative languages
Result language
angličtina
Original language name
On Asymmetric Hypergraphs
Original language description
In this paper, we prove that for any k>= 3, there exist infinitely many minimal asymmetric k-uniform hypergraphs. This is in a striking contrast to k= 2, where it has been proved recently that there are exactly 18 minimal asymmetric graphs. We also determine, for every k>= 1, the minimum size of an asymmetric k-uniform hypergraph.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2021
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
Extended Abstracts EuroComb 2021
ISBN
978-3-030-83822-5
ISSN
2297-0215
e-ISSN
—
Number of pages
6
Pages from-to
497-502
Publisher name
Springer Science and Business Media Deutschland GmbH
Place of publication
Cham
Event location
Barcelona (Online)
Event date
Sep 6, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—