Interchange theorems for hypergraphs and factorization of their degree sequences

DOI10.1006/EUJC.1998.0252MaRDI QIDQ1279865zbMATH OpenOpenAlexFDO

Authors A. A. Chernyak

Publication date 3 November 1999

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ce27c11ae9ed1c8819e657e6fabaa10d27206dd8

zbMATH Keywords

degree sequencesfactorizationhypergraphinterchange theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

In order to unify interchange theorems and extend them to hypergraphs, some sufficient conditions for equality of the \(l_1\)-distance between equivalent classes and the \(l_1\)-distance between corresponding order-type functions are proved. The generality of this result is demonstrated by a number of new corollaries concerning the factorization and the switching completeness of degree sequences of graphs and hypergraphs.

Recommendations

• On 3-hypergraphs with equal degree sequences.
• New results on degree sequences of uniform hypergraphs
• scientific article; zbMATH DE number 4045790
• scientific article; zbMATH DE number 1560890
• Matrices with prescribed row, column and block sums

Cited in

(1)

• scientific article; zbMATH DE number 4045790 (Why is no real title available?)

This page was built for publication: Interchange theorems for hypergraphs and factorization of their degree sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1279865)