Tight paths in fully directed hypergraphs

arXiv:2601.00144 · math.CO · Submitted 2026-01-01 · Read on arXiv

math.CO

Submitted: 2026-01-01

Updated: 2026-10-29

Terminology

• Hypergraph — 3× in this paper · explained in 2 episodes
• Hypergraphs — 1× in this paper · explained in 2 episodes

Related papers

• Exponential random graph models with soft clique constraints
• Equilateral Completion in Floretion Triangular Coordinates: Locality, Product Points, and Reflection Symmetry
• Two Linear Programs are Better than One
• Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
• A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
• Arithmetic Circuits and Neural Networks for Regular Matroids