Hypergraph Representation via Axis-Aligned Point-Subspace Cover
We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short. Given positive integers $\ell, d$, and $k$ with $\ell\...
Saved in:
Main Authors: | Oksana Firman, Joachim Spoerhase |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2025-02-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | http://dmtcs.episciences.org/11676/pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Treewidth 2 in the Planar Graph Product Structure Theorem
by: Marc Distel, et al.
Published: (2025-03-01) -
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Marcin Pilipczuk, et al.
Published: (2025-03-01) -
On the on-line coloring of unit interval graphs with proper interval representation
by: Israel R. Curbelo, et al.
Published: (2025-02-01) -
Combinatoric-Variational Approach to Solving Inverse Problems in Geophysics Within the Framework of the Discrete Potential Theory. Complex Geological Environment
by: Stepanova Inna, et al.
Published: (2025-03-01) -
Key-avoidance for alternating sign matrices
by: Mathilde Bouvel, et al.
Published: (2025-03-01)