Enumeration and randomized constructions of hypertrees

DOI10.1002/rsa.20841zbMath1433.05340arXiv1801.02423OpenAlexW2910179681WikidataQ128578653 ScholiaQ128578653MaRDI QIDQ4973641

Yuval Peled, Nathan Linial

Publication date: 28 November 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.02423

zbMATH Keywords

simplicial complexeshomologyhypertreesthe probabilistic method

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Enumeration in graph theory (05C30) Singular homology and cohomology theory (55N10) Combinatorial aspects of simplicial complexes (05E45)

Related Items (4)

Topology and geometry of random 2-dimensional hypertrees ⋮ The local weak limit of 𝑘-dimensional hypertrees ⋮ In search of hyperpaths ⋮ The worst way to collapse a simplex

This page was built for publication: Enumeration and randomized constructions of hypertrees