Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Opuscula Mathematica

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Maximum packings of the a-fold complete 3-uniform hypergraph with loose 3-cycles

Bunge Ryan C., Collins Dontez, Conko-Camel Daryl, El-Zanati Saad I., Liebrecht Rachel, Vasquez Alexander

Opuscula Mathematica

2020

Vol. 40, no. 2

209--225

It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order v if and only if v ≡0, 1, or 2 (mod 9). For all positive integers λand v, we find a maximum packing with loose 3-cycles of the λ-fold complete 3-uniform hypergraph of order v. We show that, if v ≥6, such a packing has a leave of two or fewer edges.

On 1-rotational decompositions of complete graphs into tripartite graphs

Bunge Ryan C.

Opuscula Mathematica

2019

Vol. 39, no. 5

623--643

Consider a tripartite graph to be any simple graph that admits a proper vertex coloring in at most 3 colors. Let G be a tripartite graph with n edges, one of which is a pendent edge. This paper introduces a labeling on such a graph G used to achieve 1-rotational G-decompositions of K2nt for any positive integer t. It is also shown that if G with a pendent edge is the result of adding an edge to a path on n vertices, then G admits such a labeling.