A characterization of totally balanced hypergraphs (Q1066918): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Jenő Lehel / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Q789408 / rank | |||
| Property / author | |||
| Property / author: Jenő Lehel / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Leszek S. Zaremba / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypergraphs with no special cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterizations of totally balanced matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3879274 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs whose neighborhoods have no special cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4200096 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterizations of strongly chordal graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convexity in Graphs and Hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypergraphes arbores / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypergraphs without a large star / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4068768 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Totally-Balanced and Greedy Matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3218167 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On hypergraphs without significant cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5563939 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3880849 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial Configurations / rank | |||
Normal rank | |||
Latest revision as of 19:37, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of totally balanced hypergraphs |
scientific article |
Statements
A characterization of totally balanced hypergraphs (English)
0 references
1985
0 references
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\).
0 references
totally balanced hypergraphs
0 references
tree-hypergraphs
0 references
