Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory

DOI10.1016/0097-3165(86)90026-9zbMath0611.05044OpenAlexW1996208650WikidataQ124853600 ScholiaQ124853600MaRDI QIDQ1087559

Kenneth A. Berman, Noga Alon

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90026-9

zbMATH Keywords

generatorsinvariant theoryfiniteness theoremregular hypergraphdecomposable forms

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items

The smallest n-uniform hypergraph with positive discrepancy, Choosability and fractional chromatic numbers, Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs, Forcing \(k\)-repetitions in degree sequences, Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree, Indecomposable regular graphs and hypergraphs, Indecomposable factorizations of multigraphs

Cites Work

• The smallest n-uniform hypergraph with positive discrepancy
• A FINITENESS THEOREM FOR REPRESENTATIONS WITH A FREE ALGEBRA OF INVARIANTS
• The invariant theory of binary forms
• A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item