Hyperpaths

DOI10.1007/S00454-021-00360-XMaRDI QIDQ6354125arXivFDO

Authors Amir Dahari, Nathan Linial

Publication date 19 November 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00454-021-00360-X

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of simplicial complexes (05E45) Direct numerical methods for linear systems and matrix inversion (65F05)

arXiv classification

cs.CCmath.CO

Abstract: Hypertrees are high-dimensional counterparts of graph theoretic trees. They have attracted a great deal of attention by various investigators. Here we introduce and study Hyperpaths -- a particular class of hypertrees which are high dimensional analogs of paths in graph theory. A $d$-dimensional hyperpath is a $d$-dimensional hypertree in which every $(d-1)$-dimensional face is contained in at most $(d+1)$ faces of dimension $d$. We introduce a possibly infinite family of hyperpaths for every dimension, and investigate its properties in greater depth for dimension $d=2$.

This page was built for publication: Hyperpaths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6354125)