Open AccessBook
Hypergraphs: Combinatorics of Finite Sets
Claude Berge
- 11 Jul 2011
1K
TL;DR: This chapter discusses Hypergraphs Generalising Bipartite Graphs, which are a collection of hypergraphs designed to solve the problem of Uniform Colourings in Matroids, and some of the properties of these graphs.
read more
Abstract: 1. General Concepts. Dual Hypergraphs. Degrees. Intersecting Families. The Coloured Edge Property and Chvatal's Conjecture. The Helly Property. Section of a Hypergraph and the Kruskal-Katona Theorem. Conformal Hypergraphs. Representative Graphs. 2. Transversal Sets and Matchings. Transversal Hypergraphs. The Coefficients r and r'. r-Critical Hypergraphs. The Konig Property. 3. Fractional Transversals. Fractional Transversal Number. Fractional Matching of a Graph. Fractional Transversal Number of a Regularisable Hypergraph. Greedy Transversal Number. Ryser's Conjecture. Transversal Number of Product Hypergraphs. 4. Colourings. Chromatic Number. Particular Kinds of Colourings. Uniform Colourings. Extremal Problems Related to the Chromatic Number. Good Edge-Colourings of a Complete Hypergraph. An Application to an Extremal Problem. Kneser's Problem. 5. Hypergraphs Generalising Bipartite Graphs. Hypergraphs without Odd Cycles. Unimodular Hypergraphs. Balanced Hypergraphs. Arboreal Hypergraphs. Normal Hypergraphs. Mengerian Hypergraphs. Paranormal Hypergraphs. Appendix: Matchings and Colourings in Matroids. References.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An Efficient Algorithm for the Transversal Hypergraph Generation
TL;DR: It is shown that the proposed algorithm operates in a way that rules out regeneration and, thus, its memory requirements are polynomially bounded to the size of the input hypergraph.
Decompositions of the 3-uniform hypergraphs K v (3) into hypergraphs of a certain type
Tao Feng,Yanxun Chang +1 more
TL;DR: In this paper, a generalization of graph decomposition called hypergraph decomposition is introduced, and it is shown that a decomposition of a 3-uniform hypergraph into a special kind of hypergraph K ≥ 0, 1, 2 (mod 9) and v ≥ 9 is possible if and only if v ≡ 0.
Algorithms for inferring functional dependencies from relations
Heikki Mannila,Kari-Jouko Räihä +1 more
- 01 Feb 1994
TL;DR: Two algorithms with better best case behavior than the simple one are developed to solve the dependency inference problem of finding a cover of the set of functional dependencies that hold in a given relation.
Some new trace formulas of tensors with applications in spectral hypergraph theory
TL;DR: In this article, the authors give graph theoretical formulas for the trace of a tensor which do not involve the differential operators and auxiliary matrix and give a characterization (in terms of the traces of the adjacency tensors) of uniform hypergraphs whose spectra are -symmetric.
Dynamical systems defined on simplicial complexes: Symmetries, conjugacies, and invariant subspaces.
Eddie Nijholt,Lee DeVille +1 more
TL;DR: In this paper , the authors consider the general model for dynamical systems defined on a simplicial complex and describe the conjugacy classes of these systems and show how symmetries in a given simplicial-complex complex manifest in the dynamics defined thereon, especially with regard to invariant subspaces.