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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Mathematics and Theoretical Computer Science Ročník 27; číslo 2; s. 1 - 15
Hlavní autori:	Firman, Oksana, Spoerhase, Joachim
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Nancy DMTCS 01.08.2025 Discrete Mathematics & Theoretical Computer Science
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!