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
•Posted Content
On generalised Kneser colourings
TL;DR: In this article, it was shown that Ziegler's lower bound on the chromatic number of an s-disjoint r-uniform Kneser hypergraph only holds if we consider r-multisets as hyperedges.
2
An efficient local search for the constrained symmetric latin square construction problem
TL;DR: For randomly generated instances, the iterated local search algorithm frequently constructs a larger partial SLS than state-of-the-art solvers such as IBM ILOG CPLEX, LocalSolver and WCSP.
2
Topological Signal Processing over Generalized Cell Complexes
Stefania Sardellitti,Sergio Barbarossa +1 more
TL;DR: Topological Signal Processing over generalized cell complexes extends GSP to analyze signals defined over sets of any order and capture multiway relations of any order among the data. It overcomes limitations of simplicial complexes and provides a better trade-off between complexity and accuracy.
2
Learning Graphs and Simplicial Complexes from Data
Andrei Buciulea,Elvin Isufi,Geert Leus,Antonio G. Marqués +3 more
- 14 Apr 2024
TL;DR: Learning graph and simplicial complex structures from data, incorporating second-order interactions, is achieved through a novel framework that combines graph autoregressive Volterra modeling with structured graph Volterra kernels.
2
The dynamics and convergence of the directed hyper-network evolutionary games
25 Jul 2022
TL;DR: In this paper , a new networked evolutionary game (NEG) called direct hyper-network evolutionary games (DHNEGs) is proposed, which uses the semi-tensor product of matrices to transform DHNEG whose strategy updating rule is myopic best response adjustment rule into an algebraic form, and study its dynamic evolution process.
1