Hypergraph Representation via Axis-Aligned Point-Subspace Cover

A k-hypergraph is a k-partite k-uniform hypergraph, that is, a hypergraph with a partition of vertices into k parts such that each hyperedge contains exactly one vertex of each part. We propose a new geometric representation of k-hypergraphs. Namely, given positive integers l, d, and k with l [less...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Mathematics and Theoretical Computer Science Jg. 27; H. 2; S. 1 - 15
Hauptverfasser:	Firman, Oksana, Spoerhase, Joachim
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Nancy DMTCS 01.08.2025 Discrete Mathematics & Theoretical Computer Science
Schlagworte:	Algorithms Apexes computer science - discrete mathematics Graph theory Graphs Mathematical research mathematics - combinatorics Polynomials Representations Structural analysis Subspaces Vertex sets Germany
ISSN:	1462-7264, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!