A characterization of totally balanced hypergraphs
type: Item
instance of: scholarly article
title: A characterization of totally balanced hypergraphs
zbMATH Open document ID: 0579.05041
DOI: 10.1016/0012-365X(85)90156-6
published in: Discrete Mathematics
publication date: 1985-01-01T00:00:00Z
review text: In this paper, totally balanced hypergraphs are viewed as special tree- hypergraphs. Theorem 3.4 immediately implies the following result due to Anstee: every totally balanced hypergraph on n vertices can be completed by new edges to a totally balanced simple hypergraph with maximal number of edges in which the number of k-element edges, \(1\leq k\leq n\), is equal to \(n-k+1\).
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 3926959
zbMATH Keywords: totally balanced hypergraphs
zbMATH Keywords: tree-hypergraphs
author: Jeno Lehel
reviewed by: Leszek S. Zaremba
MaRDI profile type: Publication
cites work: Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
cites work: Hypergraphs with no special cycles
cites work: Characterizations of totally balanced matrices
cites work: Q3941433
cites work: Q3879274
cites work: Graphs whose neighborhoods have no special cycles
cites work: Q4200096
cites work: Characterizations of strongly chordal graphs
cites work: Convexity in Graphs and Hypergraphs
cites work: Hypergraphes arbores
cites work: Hypergraphs without a large star
cites work: Q4068768
cites work: Totally-Balanced and Greedy Matrices
cites work: Q3218167
cites work: On hypergraphs without significant cycles
cites work: Q5563939
cites work: Q3880849
cites work: Combinatorial Configurations
description: scientific article; zbMATH DE number 3926959