论文信息 - A characterization of totally balanced hypergraphs

A characterization of totally balanced hypergraphs

Abstract A hypergraph is totally balanced if every non-trivial cycle has an edge containing at least three vertices of the cycle. Totally balanced hypergraphs are characterized here as special tree-hypergraphs. This approach provides a conceptually simpler proof of Anstee's related result and yields the structural description of totally balanced hypergraphs.

Jenö Lehel

[1] Martin Farber,et al. Characterizations of strongly chordal graphs , 1983, Discret. Math..

[2] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[3] B. Devadas Acharya,et al. Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality , 1982 .

[4] L. Lovász. Combinatorial problems and exercises , 1979 .

[5] Zsolt Tuza,et al. Hypergraphs without a large star , 1985, Discret. Math..

[6] A. Hoffman,et al. Totally-Balanced and Greedy Matrices , 1985 .

[7] Richard P. Anstee,et al. Characterizations of Totally Balanced Matrices , 1984, J. Algorithms.

[8] M. Farber,et al. Convexity in graphs and hypergraphs , 1986 .

[9] Alexander Schrijver,et al. Graphs whose neighborhoods have no special cycles , 1983, Discrete Mathematics.

[10] Richard P. Anstee. Hypergraphs with no special cycles , 1983, Comb..

[11] P. Hansen,et al. On a property of hypergraphs with no cycles of length greater than two , 1974 .

[12] Mordechai Lewin. On hypergraphs without significant cycles , 1976 .