Triangulated spheres and colored cliques (Q1864189): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00454-002-2792-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011158566 / rank | |||
Normal rank | |||
Latest revision as of 20:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangulated spheres and colored cliques |
scientific article |
Statements
Triangulated spheres and colored cliques (English)
0 references
17 March 2003
0 references
\textit{R. Aharoni} and \textit{P. Haxell} [J. Graph Theory 35, 83-88 (2000; Zbl 0956.05075)] proved a generalization of Hall's theorem which concerns families of sets, to families of hypergraphs. \textit{R. Meshulam} [The clique complex and hypergraph matching, Combinatorica 21(1), 89-94 (2001)] proved an extension of this result, using homology and the nerve theorem. The present paper re-proves Meshulam's result, using a more elementary approach of triangulations.
0 references
Hall's theorem
0 references
\(d\)-dimensional sphere
0 references
hypergraphs
0 references
system of disjoint representatives
0 references
