The edge-coloring of complete hypergraphs I
Copyright policy )The edge-coloring of complete hypergraphs I
AbstractThis paper contains and generalizes the solution of the following classical problem:If h | n then the h-element subsets of an n-element set can be partitioned into (h−1n−1) classes so that every class contains nh disjoint h-element sets and every h-element set appears in exactly one class. A short formulation of this statement is: If h | n then the hypergraph Knh is 1-factorizable. In this paper we study the factorization and edge-coloring problems of the hypergraph Krxmh (which is the complete, regular, h-uniform, r-partite hypergraph with m vertices in each of the r classes of vertices).
- Eötvös Loránd University Hungary
Permutations, words, matrices, Coloring of graphs and hypergraphs, Computational Theory and Mathematics, complete hypergraphs, edge-coloring, Discrete Mathematics and Combinatorics, Hypergraphs, Theoretical Computer Science
Permutations, words, matrices, Coloring of graphs and hypergraphs, Computational Theory and Mathematics, complete hypergraphs, edge-coloring, Discrete Mathematics and Combinatorics, Hypergraphs, Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).27 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!