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
•Dissertation
Propiedades algebraicas de los ideales asociados a hipergrafos
Alix Enríquez,Viviana Guerrero +1 more
- 19 May 2012
TL;DR: In particular, Faridi et al. as mentioned in this paper presentan algunas propiedades adicionales relacionadas con hipergrafos y sus cubrimientos.
Algebraic Properties of Monomial Ideals
Ali Alilooee
- 04 Sep 2015
TL;DR: In this article, a special class of squarefree monomial ideals, namely, path ideals, are studied and a formula to compute all graded Betti numbers of the path ideal of a cycle and a path is given.
Weighted 2-sections and hypergraph reconstruction
TL;DR: In this article , the notion of weighted 2-sections of hypergraphs with integer weights was introduced and the following hypergraph reconstruction problems were studied: given a weighted graph G,w, is there a hypergraph H such that (G,w) is its weighted 2section?
Some classifications of graphs with respect to a set adjacency relation
TL;DR: For any finite simple undirected graph G = (V (G),E(G),G), this paper considers the binary relation ←G on the powerset 𝒫(V (V))) of its vertex set given by B ←GA if ⋂v∈BNG(v) ⊇⋂ v∈ANG(v), where NG( v) denotes th...
Shortened Array Codes of Large Girth
TL;DR: In this paper, the authors proposed to shorten array codes by deleting certain columns of their parity-check matrices so as to increase their girth, based on the observation that for array codes, and in fact for a slightly more general class of LDPC codes, the cycles in the Tanner graph are governed by certain homogeneous linear equations with integer coefficients.