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
Malicious Cyber Activity Detection using Zigzag Persistence
Audun Myers,Alyson Bittner,Sinan G. Aksoy,Dan Best,Gregory Henselman‐Petrusek,Helen Jenne,Cliff Joslyn,Bill Kay,Garret Seppala,Stephen J. Young,Emilie Purvine +10 more
- 07 Nov 2023
1
Automatically Identifying Shared Root Causes of Test Breakages in SAP HANA
01 May 2022
TL;DR: In this paper , the authors investigate multiple similarity functions between test breakages to assist and automate the identification of test breakage that are caused by the same root cause, which can significantly reduce the cost of the post-breakage steps.
1
•Posted Content
Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time
TL;DR: In this article, it was shown that the Strong Exponential Time Hypothesis is not true and that the problem of computing the union join graph and the subset graph for acyclic hypergraphs cannot be solved in O(n 2 - \varepsilon) time.
1
A note on hypertournaments
TL;DR: In this article, it was proved that for given integer k ≥ 2, almost all k-hypertournaments are strong and in almost allk-hypertext tournaments, every pair of vertices lies on a 3-cycle.
1
•Journal Article
Patches and restricted hypergraphs
R. Dharmarajan,D. Ramachandran +1 more
TL;DR: The notion of restricted hypergraphs was introduced in this article, where a partial hypergraph of a simple hypergraph has the property that each hyperedge is contained in the smaller vertex set on which it is built.
1