A DECOMPOSITION OF COMPLETE BIPARTITE 4-UNIFORM HYPERGRAPH INTO LOOSE CYCLES
International Journal of Mathematics and Statistics · 15.02.2023 · 4 (2)
DOI: 10.53555/eijms.v4i2.19 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Mathematics and Statistics, online erschienen am 15.02.2023. Verfasst von Chunlei Xu.
Abstract (Originalsprache)
A k-uniform hypergraph H is a pair (V,ε), where V = {v1,v2,...,vn} is a set of n vertices and ε is a family of k-subset of V called hyperedges. We consider the problem of constructing a decomposition for complete bipartite uniform hypergraph into loose cycles.
Zitieren
APA
Xu, C. (2023). A DECOMPOSITION OF COMPLETE BIPARTITE 4-UNIFORM HYPERGRAPH INTO LOOSE CYCLES. International Journal of Mathematics and Statistics, 4(2). https://doi.org/10.53555/eijms.v4i2.19
Vancouver
Xu C. A DECOMPOSITION OF COMPLETE BIPARTITE 4-UNIFORM HYPERGRAPH INTO LOOSE CYCLES. International Journal of Mathematics and Statistics. 2023;4(2). doi:10.53555/eijms.v4i2.19
BibTeX
@article{Xu2023,
author = {Xu, Chunlei},
title = {A DECOMPOSITION OF COMPLETE BIPARTITE 4-UNIFORM HYPERGRAPH INTO LOOSE CYCLES},
journal = {International Journal of Mathematics and Statistics},
year = {2023},
volume = {4},
number = {2},
doi = {10.53555/eijms.v4i2.19}
}
EUVIMED